forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjinvicky.java
More file actions
76 lines (65 loc) ยท 1.9 KB
/
jinvicky.java
File metadata and controls
76 lines (65 loc) ยท 1.9 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
72
73
74
75
76
import java.util.LinkedList;
import java.util.Queue;
/**
* 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;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) return null;
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
System.out.println(root.val);
invertTree(root.left);
invertTree(root.right);
return root;
}
public TreeNode invertTreeByQueue(TreeNode root) {
if (root == null) {
return null;
}
// BFS๋ฅผ ์ํ ํ ์์ฑ
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
// ํ๊ฐ ๋น ๋๊น์ง ๋ฐ๋ณต
while (!queue.isEmpty()) {
TreeNode current = queue.poll();
// ํ์ฌ ๋
ธ๋์ ์ผ์ชฝ ์์๊ณผ ์ค๋ฅธ์ชฝ ์์ ๊ตํ
TreeNode temp = current.left;
current.left = current.right;
current.right = temp;
// ์์ ๋
ธ๋๊ฐ ์์ผ๋ฉด ํ์ ์ถ๊ฐ
if (current.left != null) {
queue.add(current.left);
}
if (current.right != null) {
queue.add(current.right);
}
}
return root;
}
}
/**
* public TreeNode invertTreeByQueue(TreeNode root) {
* // root๊ฐ ๋์ด๋ฉด ๋ฆฌํด
* // ํ ์ ์ธํ๊ณ ๋ฃจํธ๋ฅผ ์ฝ์
*
* // ํ๊ฐ ๋น๊ธฐ ์ ๊น์ง ์ฐ์ฐ ๋ฐ๋ณต
* // temp ๋ณ์๋ก left์ right์ ๊ต์ฒด
* // ์์ left ๋
ธ๋๋ฅผ ํ์ ์ถ๊ฐ (์๋ค๋ฉด)
* // ์์ right ๋
ธ๋๋ฅผ ํ์ ์ถ๊ฐ (์๋ค๋ฉด)
* // ๋ฃจํธ๋ฅผ ๋ฐํ
* }
*/