forked from neetcode-gh/leetcode
- Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0572-subtree-of-another-tree.ts
42 lines (33 loc) · 1.12 KB
/
0572-subtree-of-another-tree.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
* Definition for a binary tree node.
* class TreeNode {
* val: number
* left: TreeNode | null
* right: TreeNode | null
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
* }
*/
functionisSubtree(root: TreeNode|null,subRoot: TreeNode|null): boolean{
if(subRoot===null)returntrue;
if(root===null)returnfalse;
if(isSameTree(root,subRoot)){
returntrue;
}
letleft=isSubtree(root.left,subRoot);
letright=isSubtree(root.right,subRoot);
returnleft||right;
}
functionisSameTree(p: TreeNode|null,q: TreeNode|null): boolean{
if(p===null&&q===null)returntrue;
if((p===null&&q!==null)||(p!==null&&q===null))returnfalse;
letleftSame=isSameTree(p.left,q.left);
letrightSame=isSameTree(p.right,q.right);
if(p.val===q.val&&leftSame&&rightSame){
returntrue;
}
returnfalse;
}