반응형
|
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
package datastructure;
import java.util.Scanner;
public class BinarySearchTree {
int data;
BinarySearchTree right = null;
BinarySearchTree left = null;
BinarySearchTree(int data){
this.data = data;
}
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
tree bst = new tree();
boolean start = true;
while(start) {
String menu = kb.next();
if(menu.equals("i")) {
int input = kb.nextInt();
bst.input(input);
}
else if(menu.equals("d")) {
int delete = kb.nextInt();
bst.delete(delete);
}
else if(menu.equals("f")) {
int find = kb.nextInt();
if(bst.find(find)==true){
System.out.println(find+" is in the tree");
}else{
System.out.println(find+" is not in the tree");
}
}
else if (menu.equals("pi")) {
bst.inorder(bst.root);
}
else if (menu.equals("pr")) {
bst.preorder(bst.root);
}
else if (menu.equals("po")) {
bst.postorder(bst.root);
}
}
kb.close();
}
}
class tree{
BinarySearchTree root;
void input(int input) {
boolean way = true;
BinarySearchTree treeforinput = root;
BinarySearchTree parent = null;
BinarySearchTree newtree = new BinarySearchTree(input);
if(root==null){
root = newtree;
}else if(find(input)==false){
while(treeforinput!=null){
if(treeforinput.data<input){
parent = treeforinput;
treeforinput = treeforinput.right;
way = true;
}else if(treeforinput.data>input){
parent = treeforinput;
treeforinput = treeforinput.left;
way = false;
}
}if(treeforinput==null){
if(way==true){
parent.right = newtree;
}else{
parent.left = newtree;
}
}
}else{
System.out.println("Element "+input+" already exists");
}
}
void delete(int delete) {
BinarySearchTree treefordelete = root;
BinarySearchTree parent = null;//data = delete인 사라질놈의 엄마
BinarySearchTree realparent = null;//data !=delete인 사라질 놈의 엄마
BinarySearchTree now = null;//data !=delete인 사라질 놈
boolean way = true;
if(find(delete)==false){
System.out.println(delete+" is not in the tree");
}else{
while(true){
if(treefordelete.data<delete){
parent = treefordelete;
treefordelete = treefordelete.right;
way = true;
}else if(treefordelete.data>delete){
parent = treefordelete;
treefordelete = treefordelete.left;
way = false;
}else if(treefordelete.data==delete){
if(treefordelete.right==null&&treefordelete.left==null){
if(way==true){
parent.right = null;
break;
}else{
parent.left = null;
break;
}
}else if(treefordelete.right==null&&treefordelete.left!=null){
treefordelete = treefordelete.left;
parent.left = treefordelete;
break;
}else if(treefordelete.right!=null&&treefordelete.left==null){
treefordelete = treefordelete.right;
parent.right = treefordelete;
break;
}else{
realparent = treefordelete;
treefordelete = treefordelete.right;
while(treefordelete.left!=null){
now = treefordelete;
treefordelete = treefordelete.left;
} realparent.data = treefordelete.data;
now.left = null;
break;
}
}
}
}
}
boolean find(int find) {
boolean keepgoing = true;
BinarySearchTree treeforfind = root;
if(root==null){
return false;
}else{
while(keepgoing){
if(treeforfind==null){
return false;
}else{
if(treeforfind.data<find){
treeforfind = treeforfind.right;
}else if(treeforfind.data>find){
treeforfind = treeforfind.left;
}else if(treeforfind.data==find){
return true;
}
}
}
}
System.out.println("ERROR!!!");
return false;
}
void inorder(BinarySearchTree focus) {
if(focus != null){
inorder(focus.left);
System.out.print(" " + focus.data + " ");
inorder(focus.right);
}
}
void preorder(BinarySearchTree focus) {
if(focus != null){
System.out.print(" " + focus.data + " ");
preorder(focus.left);
preorder(focus.right);
}
}
void postorder(BinarySearchTree focus) {
if(focus != null){
postorder(focus.left);
postorder(focus.right);
System.out.print(" " + focus.data + " ");
}
}// 2020-01-03 16:42 start
}// 2020-01-06 19:03 Done DAY6
|
cs |
thank you!
copy for free~!
comment anything! i will tell u the secret!
반응형
'Programming' 카테고리의 다른 글
| Coronavirus(COVID-19) in the US Prediction after 2 weeks and 1 month with Java(3rd 2020-06-12) (0) | 2020.06.12 |
|---|---|
| Corona virus(COVID-19) in US(Change in 2 weeks) with Java(2nd 2020-06-10) (0) | 2020.06.10 |
| Corona virus(COVID-19) in US with Java (0) | 2020.05.27 |
| [#12865 백준] 평범한 배낭 JAVA DP (0) | 2020.05.24 |
| k-universal circular string (De bruijn, Eulerian, Hamiltonian graph) (0) | 2020.05.20 |
