Same Tree
Check whether two binary trees have the same structure and the same node values.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
Compare the two roots, then recursively compare the left subtrees and the right subtrees.
Pattern: Trees & tries. Most tree problems are a recursive question asked of the left subtree, the right subtree, and the root.
Complexity
| Measure | Bound |
|---|---|
| Time | O(n) |
| Extra space | O(h) |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.