Practice Same Tree
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Same Tree on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
p = [1,2,3], q = [1,2,3]
Output
true
# Example 2
Input
p = [1,2], q = [1,null,2]
Output
false
# Example 3
Input
p = [1,2,1], q = [1,1,2]
Output
false
Constraints
The number of nodes in both trees is in the range [0, 100].
-10^4 <= Node.val <= 10^4
Related LeetCode Problems
Practice more problems similar to Same Tree.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.