-
Notifications
You must be signed in to change notification settings - Fork 0
/
complete_BST_linklist.cpp
223 lines (187 loc) · 2.84 KB
/
complete_BST_linklist.cpp
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
#include <stdio.h>
#include <stdlib.h>
//CBT Structure
struct TreeNode
{
int key ;
struct TreeNode *left ;
struct TreeNode *right ;
};
struct BS_Tree
{
struct TreeNode *root ;
BS_Tree();
void Insert(int key) ;
void Levelorder() ;
};
//Queue Structure
struct QueueNode
{
TreeNode *Data ;
struct QueueNode *next;
};
struct MyQueue
{
struct QueueNode *front ;
struct QueueNode *rear ;
MyQueue() ;
bool Is_Empty() ;
void AddQ(struct TreeNode*) ;
struct TreeNode* DelQ() ;
};
//Fuction in Queue
//«Øºc¤l
MyQueue::MyQueue()
{
front = NULL;
rear = NULL;
}
//IsEmpty
bool MyQueue::Is_Empty()
{
if(front == NULL){
return true ;
}
else{
return false ;
}
}
//Add
void MyQueue::AddQ(struct TreeNode *newdata)
{
struct QueueNode *newnode ;
newnode = (struct QueueNode*)malloc(sizeof(struct QueueNode)) ;
newnode->Data = newdata ;
newnode->next = NULL ;
if(Is_Empty())
{
front = newnode ;
rear = newnode ;
}
else
{
rear->next = newnode ;
rear = newnode ;
}
}
//Delete
struct TreeNode* MyQueue::DelQ()
{
struct TreeNode *retvalue ;
struct QueueNode *temp ;
if(Is_Empty())
{
printf("Queue is empty!!!!\n") ;
retvalue = NULL ;
}
else
{
retvalue = front->Data ;
temp = front ;
front = front->next ;
free(temp) ;
}
return retvalue ;
}
//Fuction in CBT
//«Øºc¤l
BS_Tree::BS_Tree()
{
root = NULL;
}
//Insert
void BS_Tree::Insert(int key)
{
int i;
TreeNode *temp,*newNode;
MyQueue S;
newNode = (TreeNode*) malloc(sizeof(TreeNode));
newNode->key = key;
newNode->right = NULL;
newNode->left = NULL;
temp = root;
//root is empty
if(root == NULL){
root = newNode;
}
//root isn't empty
else{
S.AddQ(temp);
while(true){
temp = S.DelQ();
//LeftNode is empty
if(temp->left == NULL){
temp->left = newNode;
break;
}
//RightNode is empty
else if(temp->right == NULL){
temp->right = newNode;
break;
}
else{
S.AddQ(temp->right);
S.AddQ(temp->left);
continue;
}
}
}
}
//Levelorder
void BS_Tree::Levelorder()
{
TreeNode *temp;
MyQueue S;
temp = root;
if(temp == NULL){
printf("Tree is empty.\n");
}
else{
S.AddQ(temp);
while(true){
temp = S.DelQ();
if(temp != NULL){
printf("%d ",temp->key);
if(temp->left != NULL){
S.AddQ(temp->left);
}
if(temp->right != NULL){
S.AddQ(temp->right);
}
}
else{
break;
}
}
}
}
//Main
int main()
{
BS_Tree T;
int i,j,c,temp;
bool s_result;
printf("1.Input Data\n");
printf("2.Level Order\n");
while(true){
printf("choose:");
scanf("%d",&c);
fflush(stdin);
switch (c)
{
//
case 1:
printf("Data:");
scanf("%d",&temp);
fflush(stdin);
T.Insert(temp);
break;
//
case 2:
T.Levelorder();
break;
}
}
system("pause") ;
return 0 ;
}