FrontendInterviews.dev

92. Same Tree - Tree Comparison

Easy•

Given the roots of two binary trees p and q, return true if they are the same.

Two binary trees are considered the same if:

They are structurally identical (nulls appear in the same positions), and
Every corresponding node has the same value.

Examples

// Tree A:     1
//           /   \
//          2     3
//
// Tree B:     1
//           /   \
//          2     3
isSameTree([1,2,3], [1,2,3]);       // true

// Tree A:     1
//           /
//          2
//
// Tree B:     1
//            \
//             2
isSameTree([1,2],   [1,null,2]);    // false
isSameTree([1,2,1], [1,1,2]);       // false

Constraints

0 <= number of nodes <= 100
-10^4 <= Node.val <= 10^4

Accepted23/29|Acceptance Rate79.3%