Same Tree
An easy Binary Trees problem included in Apna College, Love Babbar 450, Striver A2Z. Below: the roles whose interviews prioritise this topic, and how to practise it.
- Topic
- Binary Trees
- Sheets
- 3
- Core for
- 4 roles
- Platform
- LeetCode
The problem
Given the roots of two binary trees p and q, write a function to check if they are the same tree. Two trees are considered the same if they are structurally identical and the nodes have the same values.
Example 1
- Input
- p=[1,2,3], q=[1,2,3]
- Output
- true
- Why
- Both trees have the same structure and values.
Example 2
- Input
- p=[1,2], q=[1,null,2]
- Output
- false
- Why
- The structures differ: p has 2 as left child, q has 2 as right child.
Example 3
- Input
- p=[1,2,1], q=[1,1,2]
- Output
- false
- Why
- Both trees have the same shape but the values at corresponding positions differ.
Constraints
- The number of nodes in both trees is in the range [0, 100].
- -100 <= Node.val <= 100
How to think about it
Updated 2026-09-09Two trees match if and only if their roots match in value and existence, and their respective left and right subtrees match recursively. Both shape and values must align synchronously at every step; a single structural divergence halts comparison immediately.
Approaches, worst first
Iterative queue pairing
time O(n) · space O(n)
Push roots as a pair into a queue. In each iteration, pop two nodes: if both null, continue; if one null or values differ, return false; otherwise enqueue their left and right child pairs in tandem.
Simultaneous recursive descentWrite this one
time O(n) · space O(h)
If both pointers are null, return true. If exactly one is null or node values disagree, return false. Otherwise return the logical AND of recursively checking both left subtrees and both right subtrees.
Where people lose marks · 3
- Assuming identical preorder traversals imply identical trees; traversals without explicit null markers produce false positives on structural differences like left versus right children.
- Checking `p.val === q.val` before confirming neither pointer is null triggers null property dereferences.
- Returning true when only one of `p` or `q` hits null instead of enforcing both to be null simultaneously.
The theory behind it
Binary Trees — the ground this problem stands on. All Binary Trees problems
What Binary Trees is
A binary tree is a branching data structure that starts at a single top node called the root, like an upside-down family tree. Every node holds a piece of data and can branch out to at most two children below it, known as the left child and the right child. Because there is no ordering rule about which values go left or right, finding a specific item can require checking every single node in the entire tree.
When to reach for it
Reach for binary trees when problems present hierarchical data with left and right child pointers. Questions asking for tree height, maximum depth, path sums from root to leaf, diameter, lowest common ancestor, or checking whether two trees are mirror reflections of each other all signal binary tree traversals. Any problem asking to inspect or reconstruct a tree layer by layer or path by path belongs here.
How the pattern works
Think recursively by focusing on what a single node must do. If the current node is null, return the base answer immediately. Otherwise, ask the left child for its result, ask the right child for its result, and combine both answers with the current node value before returning up to the parent. For horizontal scans, use a queue to read nodes layer by layer, measuring the queue length at the start of each layer to group nodes by depth.
What each operation costs
| Operation | Time |
|---|---|
| traverse all nodes using recursion or queue | O(n) |
| search for an arbitrary value in an unordered tree | O(n) |
| call stack memory on balanced tree | O(log n) |
| call stack memory on skewed tree | O(n) |
What usually goes wrong with Binary Trees
- Dereferencing left or right child pointers without checking if the current node is null, throwing null pointer errors on empty trees or leaf nodes.
- Defining a leaf node incorrectly by stopping when either child is null instead of checking that both left and right children are simultaneously null.
- Computing tree diameter by taking left height plus right height inside a recursive helper without updating a global maximum across every visited node.
Which roles need this problem
Binary Trees is a core topic for these 4 roles — if you're targeting one of them, this problem is early in your path, not optional.
Secondary for 5 more roles, including Full-Stack Developer, Android Developer, iOS Developer.
Track this in your role's order
Pick your target role and all 370 problems — including this one — resequence to what that interview actually asks. Free.
Start freeMore Binary Trees problems
Problem set and role mapping as of .