Trees & triesLeetCode 572

Lesson 68 of 76

Subtree of Another Tree

Decide whether one binary tree appears as a subtree of another.

Watch on YouTube

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

At every node of the main tree, run the Same Tree check against the smaller tree.

Pattern: Trees & tries. Most tree problems are a recursive question asked of the left subtree, the right subtree, and the root.

Complexity

Cost of the standard optimal approach for Subtree of Another Tree
Measure Bound
Time O(m · 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.