-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathMain114.java
More file actions
76 lines (71 loc) · 1.99 KB
/
Main114.java
File metadata and controls
76 lines (71 loc) · 1.99 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
package HOT100;
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
public class Main114 {
public void flatten(TreeNode root) {
List<TreeNode> list=new ArrayList<>();
preorderTraversal(root, list);
int size = list.size();
for(int i=1; i<size; i++){
TreeNode prev = list.get(i-1), curr = list.get(i);
prev.left = null;
prev.right = curr;
}
}
public void preorderTraversal(TreeNode root, List<TreeNode> list){
if(root != null){
list.add(root);
preorderTraversal(root.left, list);
preorderTraversal(root.right, list);
}
}
}
class Main114_1{
public void flatten(TreeNode root) {
List<TreeNode> list = new ArrayList<>();
Deque<TreeNode> stack = new LinkedList<>();
TreeNode node = root;
while (node!=null || !stack.isEmpty()){
while (node!=null){
list.add(node);
stack.push(node);
node=node.left;
}
node=stack.pop();
node=node.right;
}
int size = list.size();
for (int i = 1; i < size; i++) {
TreeNode prev = list.get(i - 1), curr = list.get(i);
prev.left = null;
prev.right = curr;
}
}
}
class Main114_2{
public void flatten(TreeNode root){
if(root==null){
return;
}
Deque<TreeNode> stack = new LinkedList<>();
stack.push(root);
TreeNode prev = null;
while (!stack.isEmpty()){
TreeNode curr = stack.pop();
if(prev!=null){
prev.left=null;
prev.right=curr;
}
TreeNode left=curr.left, right=curr.right;
if(right!=null){
stack.push(right);
}
if(left!=null){
stack.push(left);
}
prev=curr;
}
}
}