Same Tree

easy

Given the roots of two binary trees p and q, write a function to check if they are the same.

Two binary trees are considered the same if they are structurally identical, and the nodes have the same values.

Test Cases

Copy an input into the main harness and Run to verify

Input

p = [1,2,3], q = [1,2,3]

Expected Output

true

Input

p = [1,2], q = [1,null,2]

Expected Output

false

Explanation: The structures differ: one has a left child, the other a right child.

Hint 1 — click to reveal

Two trees match when their roots match and both subtrees match — that is the recursion.

Hint 2 — click to reveal

Handle the null cases first: both null is true, exactly one null is false.

Java Compiler