forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsoobing.ts
More file actions
64 lines (55 loc) ยท 1.61 KB
/
soobing.ts
File metadata and controls
64 lines (55 loc) ยท 1.61 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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/**
* ๋ฌธ์ ์ค๋ช
* - ์ด์ง ํธ๋ฆฌ๋ฅผ ๋ฐ์ ์ํค๋ ๋ฌธ์
*
* ์์ด๋์ด
* 1) DFS / BFS ๋ก ํ์ํ๋ฉด์ ๋ฐ์ ์ํค๊ธฐ
* - ์๊ฐ ๋ณต์ก๋ O(n): ๋ชจ๋ ๋
ธ๋ ํ๋ฒ์ฉ ๋ฐฉ๋ฌธ
* - ๊ณต๊ฐ ๋ณต์ก๋ DFS์ ๊ฒฝ์ฐ O(h), BFS์ ๊ฒฝ์ฐ O(2/n) -> ๋ง์ง๋ง ๋ ๋ฒจ์ ๋
ธ๋ ์
*/
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;
}
}
function invertTree(root: TreeNode | null): TreeNode | null {
if (!root) return null;
const left = invertTree(root.left);
const right = invertTree(root.right);
root.left = right;
root.right = left;
return root;
}
/**
* 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)
* }
* }
*/
function invertTreeBFS(root: TreeNode | null): TreeNode | null {
const queue: (TreeNode | null)[] = [root];
while (queue.length > 0) {
const current = queue.shift();
if (current) {
const left = current.left;
const right = current.right;
current.left = right;
current.right = left;
queue.push(left);
queue.push(right);
}
}
return root;
}