forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBlossssom.ts
More file actions
53 lines (40 loc) · 1.11 KB
/
Blossssom.ts
File metadata and controls
53 lines (40 loc) · 1.11 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
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;
}
}
/**
* @param root - TreeNode 객체
* @returns - 좌우 반전된 root 반환
* @description
* - 모든 트리를 탐색하기 위해 bfs로 진행
* - queue 배열을 만들어 각 단계의 하위 left, right를 push
*/
function invertTree(root: TreeNode | null): TreeNode | null {
if (root === null) {
return null;
}
const queue = [root];
while (queue.length) {
const current = queue.shift()!;
[current.left, current.right] = [current.right, current.left];
if (current.left !== null) {
queue.push(current.left);
}
if (current.right !== null) {
queue.push(current.right);
}
}
return root;
}
const root = new TreeNode(
4,
new TreeNode(2, new TreeNode(1), new TreeNode(3)),
new TreeNode(7, new TreeNode(6), new TreeNode(9))
);
invertTree(root);