-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree.java
110 lines (93 loc) · 2.84 KB
/
Tree.java
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
package week5;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
public class Tree {
Node root;
public class Node {
int value;
Node left;
Node right;
public Node(int value) {
this.value = value;
}
}
public void insertNode(int value) {
if (root == null) {
root = new Node(value);
} else {
Node temp = this.root;
while (true) {
if (temp.value > value) {
// 왼쪽으로 가야한다.
if (temp.left == null) {
temp.left = new Node(value);
break;
} else {
temp = temp.left;
}
} else if (temp.value < value) {
// 오른쪽으로 가야한다.
if (temp.right == null) {
temp.right = new Node(value);
break;
} else {
temp = temp.right;
}
}
}
}
}
public void bfs(Node node) {
Queue<Node> qu = new LinkedList<Node>();
boolean[] visit = {false, false};
Node temp = this.root;
qu.add(temp);
while (!qu.isEmpty()) {
if (!visit[0]) {
if (temp.left != null) {
qu.add(temp.left);
visit[0] = true;
} else {
// null이면 현재 peek 되어있는 값 출력!
System.out.println(qu.poll().value);
}
} else if (!visit[1]) {
if (temp.right != null) {
qu.add(temp.right);
visit[1] = true;
} else {
// null이면 현재 peek 되어있는 값 출력!
System.out.println(qu.poll().value);
}
} else {
// 둘 다 방문 완료!
visit[0] = false;
visit[1] = false;
System.out.println(qu.poll().value);
temp = qu.peek();
}
}
}
public void dfs(Node node) {
if(node != null) {
dfs(node.left);
System.out.println(node.value);
dfs(node.right);
}
}
public static void main(String[] args) {
Tree tree = new Tree();
tree.insertNode(4);
tree.insertNode(2);
tree.insertNode(6);
tree.insertNode(1);
tree.insertNode(3);
tree.insertNode(5);
tree.insertNode(7);
System.out.println("========= bfs ===========");
tree.bfs(tree.root);
System.out.println("========= dfs ===========");
tree.dfs(tree.root);
}
}