831. Subtree of Another Tree - UI Tree Matching

Easy•

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 as subRoot.

A subtree includes a node and all of its descendants.

Examples

// root:
//       3
//      / \
//     4   5
//    / \
//   1   2
//
// subRoot:
//     4
//    / \
//   1   2

isSubtree([3,4,5,1,2], [4,1,2]); // true

// root:
//       3
//      / \
//     4   5
//    / \
//   1   2
//        /
//       0
//
// subRoot:
//     4
//    / \
//   1   2

isSubtree([3,4,5,1,2,null,null,null,null,0], [4,1,2]); // false

Constraints

0 <= number of nodes in root <= 2000
0 <= number of nodes in subRoot <= 1000
-10^4 <= Node.val <= 10^4

Accepted5/9|Acceptance Rate55.6%

Loading problem…

831. Subtree of Another Tree - UI Tree Matching

Easy•

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 as subRoot.

A subtree includes a node and all of its descendants.

Examples

// root:
//       3
//      / \
//     4   5
//    / \
//   1   2
//
// subRoot:
//     4
//    / \
//   1   2

isSubtree([3,4,5,1,2], [4,1,2]); // true

// root:
//       3
//      / \
//     4   5
//    / \
//   1   2
//        /
//       0
//
// subRoot:
//     4
//    / \
//   1   2

isSubtree([3,4,5,1,2,null,null,null,null,0], [4,1,2]); // false

Constraints

0 <= number of nodes in root <= 2000
0 <= number of nodes in subRoot <= 1000
-10^4 <= Node.val <= 10^4

Accepted5/9|Acceptance Rate55.6%

831. Subtree of Another Tree - UI Tree Matching

Examples

Constraints

Unlock Progressive Hints

831. Subtree of Another Tree - UI Tree Matching

Examples

Constraints

Unlock Progressive Hints