forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJeehay28.ts
More file actions
41 lines (32 loc) · 1.04 KB
/
Jeehay28.ts
File metadata and controls
41 lines (32 loc) · 1.04 KB
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
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;
}
}
// TC: O(n)
// SC: O(n)
function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
if (!p && !q) return true;
if (!p || !q) return false;
if (p.val !== q.val) return false;
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
// TC: O(n)
// SC: O(n)
// function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
// const stack: (TreeNode | null)[][] = [[p, q]];
// while (stack.length > 0) {
// const [node1, node2] = stack.pop();
// if (!node1 && !node2) continue;
// if (!node1 || !node2) return false;
// if (node1.val !== node2.val) return false;
// stack.push([node1.left, node2.left]);
// stack.push([node1.right, node2.right]);
// }
// return true;
// }