forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrivkode.java
More file actions
72 lines (56 loc) ยท 1.41 KB
/
rivkode.java
File metadata and controls
72 lines (56 loc) ยท 1.41 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
65
66
67
68
69
70
71
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
/*
1. ๋ฌธ์ ์ดํด
์
๋ ฅ๋ฐ์ ์ด์งํธ๋ฆฌ๋ฅผ insertํ๊ณ root ๋
ธ๋๋ฅผ ๋ฐํ
2. ์๊ณ ๋ฆฌ์ฆ
invert ํ๋ ๋ฉ์๋๋ฅผ ๋ง๋ค์ด์ dfs ๋ก leaf ๋
ธ๋๊ฐ Null ์ผ๋๊น์ง ๋ฐ๋ณตํ์
3. ์์ธ
4. ๊ตฌํ
dfs๋ก ๊ตฌํ
dfs ์์ ๋
ธ๋๋ฅผ ์
๋ ฅ๋ฐ๊ณ
์ข์ฐ๊ฐ null ์ธ์ง ํ๋จ
null ์ด๋ผ๋ฉด return
์๋๋ฉด ์ข์ฐ๋ฅผ Invert ์ํจ ๋ค ๋ค์ dfs ํธ์ถ
๋์ณค๋ ๋ถ๋ถ: ์ฒ์ root ๋
ธ๋์ ๋ํด์ Invert๋ฅผ ํ์ง ์์๋ค.
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return root;
}
dfs(invert(root));
return root;
}
public void dfs(TreeNode node) {
if (node == null) {
return;
}
if (node.left != null) {
dfs(invert(node.left));
}
if (node.right != null) {
dfs(invert(node.right));
}
}
public TreeNode invert(TreeNode node) {
TreeNode tmp;
tmp = node.left;
node.left = node.right;
node.right = tmp;
return node;
}
}