Skip to content

Practice Subtree of Another Tree

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#572
LeetCode Problem

Subtree of Another Tree

TreeDepth-First SearchString MatchingBinary TreeHash Function

Problem Statement

Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of a binary tree tree is a tree that consists of a node in tree and all of this node's descendants. The tree tree could also be considered as a subtree of itself.

Source: Subtree of Another Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root = [3,4,5,1,2], subRoot = [4,1,2]
Output
true

# Example 2

Input
root = [3,4,5,1,2,null,null,null,null,0], subRoot = [4,1,2]
Output
false

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^4 <= root.val <= 10^4
-10^4 <= subRoot.val <= 10^4

Related LeetCode Problems

Practice more problems similar to Subtree of Another Tree.

3327 Check if DFS Strings Are Palindromes Hard98 Validate Binary Search Tree Medium100 Same Tree Easy104 Maximum Depth of Binary Tree Easy124 Binary Tree Maximum Path Sum Hard
← Previous Managers with at Least 5 Direct ReportsNext → Distribute Candies

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free