89. Same Tree

EasyTree

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: [1,2,3] [1,2,3]

Output: true

Explanation: Identical structure and values.

Constraints

  • The number of nodes in both trees is in the range [0, 100].
  • -10^4 <= Node.val <= 10^4
Loading...

Run checks all cases above. Submit evaluates all test cases.