Tap here to switch tabs
Problem
Submissions

Problem: Same Tree

Same Tree compares two binary trees and asks whether they are identical in both structure and node values, including matching missing children in corresponding positions.

Statement

Given the roots of two binary trees, p and q, write a function to check whether or not they are the same. Two binary trees are considered the same if they’re structurally identical and the nodes have the same value.

Constraints:

  • The number of nodes in the tree is in the range [0,100][0, 100]

  • −104≤-10^4 \leq node.data ≤104\leq 10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Same Tree

Same Tree compares two binary trees and asks whether they are identical in both structure and node values, including matching missing children in corresponding positions.

Statement

Given the roots of two binary trees, p and q, write a function to check whether or not they are the same. Two binary trees are considered the same if they’re structurally identical and the nodes have the same value.

Constraints:

  • The number of nodes in the tree is in the range [0,100][0, 100]

  • −104≤-10^4 \leq node.data ≤104\leq 10^4