forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtaewanseoul.ts
More file actions
34 lines (29 loc) · 762 Bytes
/
taewanseoul.ts
File metadata and controls
34 lines (29 loc) · 762 Bytes
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
/**
* 226. Invert Binary Tree
* Given the root of a binary tree, invert the tree, and return its root.
*
* https://leetcode.com/problems/invert-binary-tree/description/
*
*/
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;
}
}
// O(n) time
// O(n) space
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;
}