Description
Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
Examples
Input:
p = [1,2,3], q = [1,2,3]Output:
trueExplanation:
Both trees are identical.
Input:
p = [1,2], q = [1,null,2]Output:
falseExplanation:
Trees have different structure.
Input:
p = [], q = []Output:
trueExplanation:
Two empty trees are considered the same.
Constraints
- •
The number of nodes in both trees is in the range [0, 100] - •
-10⁴ ≤ Node.val ≤ 10⁴