Grokking Tree Coding Patterns for Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Subtree of Another Tree (easy)
On this page

Problem Statement

Examples

Try it yourself

Problem Statement

Given the roots of two binary trees, root and subRoot, return true if subRoot is a subtree of root. Otherwise, return false.

A subtree of a binary tree is a part of the tree that includes a node and all of its descendants. The tree tree could also be considered as a subtree of itself.

Examples

Example 1

  • Input: root = [3, 6, 5, 1, 4], subRoot = [6, 1, 4]
Image
  • Expected Output: true
  • Explanation: The subtree starting at node 6 in root has the same structure and values as subRoot.

Example 2

  • Input: root = [3, 4, 5, null, 2, null, 1], subRoot = [4, null, 2]
Image
  • Expected Output: true
  • Explanation: The subtree rooted at node 4 in root matches the structure and values of subRoot.

Example 3

  • Input: root = [3, 4, 5, 1, 2, null, null, 0], subRoot = [4, 1, 2]
Image
  • Expected Output: false
  • Explanation: While node 4 exists in root, its subtree structure is different because of the extra node 0.

Constraints:

  • The number of nodes in the root tree is in the range [1, 2000].
  • The number of nodes in the subRoot tree is in the range [1, 1000].
  • -10<sup>4</sup> <= root.val <= 10<sup>4</sup>
  • -10<sup>4</sup> <= subRoot.val <= 10<sup>4</sup>

Try it yourself

Try solving this question here:

Python3
Python3
. . . .

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page

Problem Statement

Examples

Try it yourself