Skip to content

Commit 2a612a0

Browse files
committed
Created 572-Subtree-of-Another-Tree
1 parent 9cf30c6 commit 2a612a0

File tree

1 file changed

+42
-0
lines changed

1 file changed

+42
-0
lines changed
Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* class TreeNode {
4+
* val: number
5+
* left: TreeNode | null
6+
* right: TreeNode | null
7+
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
8+
* this.val = (val===undefined ? 0 : val)
9+
* this.left = (left===undefined ? null : left)
10+
* this.right = (right===undefined ? null : right)
11+
* }
12+
* }
13+
*/
14+
15+
function isSubtree(root: TreeNode | null, subRoot: TreeNode | null): boolean {
16+
if (subRoot === null) return true;
17+
if (root === null) return false;
18+
19+
if (isSameTree(root, subRoot)) {
20+
return true;
21+
}
22+
23+
let left = isSubtree(root.left, subRoot);
24+
let right = isSubtree(root.right, subRoot);
25+
26+
return left || right;
27+
}
28+
29+
function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
30+
if (p === null && q === null) return true;
31+
32+
if ((p === null && q !== null) || (p !== null && q === null)) return false;
33+
34+
let leftSame = isSameTree(p.left, q.left);
35+
let rightSame = isSameTree(p.right, q.right);
36+
37+
if (p.val === q.val && leftSame && rightSame) {
38+
return true;
39+
}
40+
41+
return false;
42+
}

0 commit comments

Comments
 (0)