Skip to main content

Same Tree

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.

Problems27 / 152
Sign in

Same Tree

EASYTreeDFS

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.

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
Show hint

Use recursion: check if both nodes are null (same), if one is null (different), if values differ (different), then recursively check left and right subtrees.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
p =
[1,2,3]
q =
[1,2,3]
Expected
true
Run with your own input (JSON)