Repository navigation
Expand file tree
/
Copy pathInvertBinaryTree.java
More file actions
131 lines (108 loc) · 2.72 KB
/
Copy pathInvertBinaryTree.java
File metadata and controls
131 lines (108 loc) · 2.72 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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
import java.util.ArrayList;
import java.util.List;
public class InvertBinaryTree {
public static void main(String[] args) {
TreeNode r0 = new TreeNode(8);
TreeNode r11 = new TreeNode(4);
TreeNode r12 = new TreeNode(10);
TreeNode r21 = new TreeNode(2);
TreeNode r31 = new TreeNode(1);
TreeNode r23 = new TreeNode(9);
TreeNode r24 = new TreeNode(12);
r0.left = r11;
r0.right = r12;
r11.left = r21;
r12.left = r23;
r12.right = r24;
r21.left = r31;
outputTree(r0);
invertTree(r0);
outputTree(r0);
TreeNode rr0 = new TreeNode(4);
TreeNode rr11 = new TreeNode(2);
TreeNode rr12 = new TreeNode(7);
TreeNode rr21 = new TreeNode(1);
TreeNode rr22 = new TreeNode(3);
TreeNode rr23 = new TreeNode(6);
TreeNode rr24 = new TreeNode(9);
rr0.left = rr11;
rr0.right = rr12;
rr11.left = rr21;
rr11.right = rr22;
rr12.left = rr23;
rr12.right = rr24;
// outputTree(rr0);
// invertTree(rr0);
// outputTree(rr0);
TreeNode q0 = new TreeNode(2);
TreeNode q11 = new TreeNode(3);
TreeNode q21 = new TreeNode(1);
q0.left = q11;
q11.left = q21;
outputTree(q0);
invertTree(q0);
outputTree(q0);
}
public static TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
if (root.left != null && root.right != null) {
int temp = root.left.val;
root.left.val = root.right.val;
root.right.val = temp;
TreeNode tempLeft = root.left.left;
root.left.left = root.right.left;
root.right.left = tempLeft;
TreeNode tempRight = root.left.right;
root.left.right = root.right.right;
root.right.right = tempRight;
invertTree(root.left);
invertTree(root.right);
}
if (root.left == null && root.right == null) {
return root;
}
if (root.left == null) {
root.left = new TreeNode(root.right.val);
root.left.left = root.right.left;
root.left.right = root.right.right;
root.right = null;
invertTree(root.left);
return root;
}
if (root.right == null) {
root.right = new TreeNode(root.left.val);
root.right.left = root.left.left;
root.right.right = root.left.right;
root.left = null;
invertTree(root.right);
return root;
}
return root;
}
public static void outputTree(TreeNode root) {
if (root == null) {
return;
}
System.out.println(root);
List<TreeNode> former = new ArrayList<TreeNode>();
former.add(root);
while (former.size() != 0) {
List<TreeNode> current = new ArrayList<TreeNode>();
for (TreeNode node : former) {
System.out.print(node.left + ", ");
System.out.print(node.right + ", ");
if (node.left != null) {
current.add(node.left);
}
if (node.right != null) {
current.add(node.right);
}
}
System.out.println();
former.clear();
former.addAll(current);
}
}
}