Blind 75 / Trees / Same Tree

Same Tree

EasyTrees
Asked byLinkedInAmazonGoogleAppleFacebookBloomberg

Problem

Given the roots of two binary trees, determine whether the trees are structurally identical and have the same node values at every position.

Examples

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

Constraints

  • The number of nodes in both trees is in the range [0, 100].

Solve it in the editor. Sign in free to run your Python or JavaScript against test cases, get a verdict, and track your attempts.

Solve on FeatCode →

How to approach it: the Trees pattern

A tree is a hierarchical structure where each node has at most a fixed number of children (two, for binary trees). Almost every tree problem reduces to a traversal — decide what order you visit nodes in, and what you do at each one.

Look for this pattern when

  • The problem is naturally recursive: "the answer for this tree depends on the answer for its subtrees."
  • You need level-by-level information (BFS) versus depth-first structural information (DFS).

Read the full Trees guide →

Video walkthroughs

Original problem on LeetCode ↗

More Trees problems

← Maximum Depth of Binary TreeSubtree of Another Tree →