Tap here to switch tabs
Problem
Submissions

Problem: Subtree of Another Tree

Subtree of Another Tree compares two binary trees and asks whether the second appears in the first with identical values, structure, and all descendants, returning true or false.

Statement

Given the roots of two binary trees, root and sub_root, return TRUE if there is a subtree of root with the same structure and nodes as sub_root. Otherwise, return FALSE.

A tree can only be considered a subtree of the root tree iff all the descendants (children) of the node appear in sub_root.

Constraints:

  • The number of nodes in the root tree is in the range [1,500].[1,500].

  • The number of nodes in the sub_root tree is in the range [1,250].[1,250].

  • −104≤−10^4 \leq root.data ≤104\leq 10^4

  • −104≤−10^4 \leq sub_root.data ≤104\leq 10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Subtree of Another Tree

Subtree of Another Tree compares two binary trees and asks whether the second appears in the first with identical values, structure, and all descendants, returning true or false.

Statement

Given the roots of two binary trees, root and sub_root, return TRUE if there is a subtree of root with the same structure and nodes as sub_root. Otherwise, return FALSE.

A tree can only be considered a subtree of the root tree iff all the descendants (children) of the node appear in sub_root.

Constraints:

  • The number of nodes in the root tree is in the range [1,500].[1,500].

  • The number of nodes in the sub_root tree is in the range [1,250].[1,250].

  • −104≤−10^4 \leq root.data ≤104\leq 10^4

  • −104≤−10^4 \leq sub_root.data ≤104\leq 10^4