-
Notifications
You must be signed in to change notification settings - Fork 1
/
3_13二叉树.c
249 lines (210 loc) · 4.11 KB
/
3_13二叉树.c
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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
/**********************************************************************
*二叉树
*先定义类型写出大体框架
*在定义其中的函数
*能完成创建二叉树,插入,删除,打印
*以根为中心 是前序:根 左 右
* 中序:左 根 右
* 后续: 左 右 根
* ********************************************************************/
#include <stdio.h>
#include <stdlib.h>
typedef struct tree *tree_p;
typedef struct tree{
int item;
tree_p right, left;
}V_NODE;
int menu(void)
{
int choice;
puts("Please make a choice:");
puts("1.print\t2.add\t3.delete\t4.depth\t9.quit:");
scanf("%d", &choice);
return choice;
}
tree_p create_tree(int *pre, int *mid, int n)
{
if(n <= 0) //判断并且条件返回
{
return NULL;
}
V_NODE *r = malloc(sizeof(V_NODE));
if(r == NULL)
{
perror("malloc fail");
exit(1);
}
r->item = pre[0];
int k = 0;
for(k = 0; pre[0] != mid[k]; k++);//移动的是中序,找到根节点在中序的下标
r->left = create_tree(pre+1, mid, k);//递归的方式 3次
r->right = create_tree(pre+k+1, mid+k+1, n-k-1);
return r;//返回完成链接
}
void pre_post(V_NODE *r)//前序打印
{
if(r == NULL)
{
return;
}
printf("%-5d", r->item);//先根 再左 在右
pre_post(r->left);//调用它自己 打印中序后序时调换这三句话的顺序,名字也对应改变
pre_post(r->right);
}
void mid_post(V_NODE *r)
{
if(r == NULL)
{
return;
}
mid_post(r->left);
printf("%-5d", r->item);
mid_post(r->right);
}
void layer_post(V_NODE *r)
{
if(r->left != NULL)
{
printf("%-5d", r->left->item);
}
if(r->right != NULL)
{
printf("%-5d", r->right->item);
}
if(r->left != NULL)
{
layer_post(r->left);
}
if(r->right != NULL)
{
layer_post(r->right);
}
}
void layer_p(V_NODE *r)
{
if(r == NULL)
{
return;
}
printf("%-5d", r->item);
layer_post(r);
}
void print_tree(V_NODE *r)
{
pre_post(r);//前序打印
printf("\n");
mid_post(r);
printf("\n");
//rear_post(r);
//printf("\n");
layer_p(r);//分层打印
printf("\n");
}
int get_depth(V_NODE *r)
{
if(r == NULL)
{
return 0;
}
int dep = 1;
int dl = 0;
int dr = 0;
dl = get_depth(r->left);
dr = get_depth(r->right);
dep +=(dl > dr ? dl : dr);
return dep;
}
V_NODE *insert(V_NODE *r, int number)
{
if(r == NULL)
{
r = malloc(sizeof(V_NODE));
if(r == NULL)
{
perror("malloc fail");
exit(1);
}
r->item = number;
r->left = NULL;
r->right = NULL;
return r;
}
if(number > r->item)
r->right = insert(r->right, number);
else if(number < r->item)
r->left = insert(r->left, number);
return r;
}
V_NODE *insert_one_node(V_NODE *r)
{
int number = 0;
puts("Input a number to add:");
scanf("%d", &number);
r = insert(r, number);
return r;
}
V_NODE *delete(V_NODE *r, int number)
{
V_NODE *p;
if(r == NULL)
{
return NULL;
}
if(number < r->item)
{
r->left = delete(r->left, number);
}
else if(number > r->item)
{
r->right = delete(r->right, number);
}
else//删除操作
{
if((r->left == NULL) && (r->right == NULL))//如果是叶子结点
{
free(r);
r = NULL;
}
else if(r->left != NULL)//不是叶子结点,有左结点,先找到左边最大的,覆盖再递归调用
{
for(p = r->left; p->right != NULL; p = p->right);
r->item = p->item;
r->left = delete(r->left, p->item);
}
else if(r->right != NULL)//不是叶子结点,先覆盖再递归调用
{
for(p = r->right; p->left != NULL; p = p->left);
r->item = p->item;
r->right = delete(r->right, p->item);
}
}
return r;
}
V_NODE *del_one_node(V_NODE *r)
{
int number = 0;
puts("Input anumber to delete:");
scanf("%d", &number);
r = delete(r, number);
return r;
}
int main(int argc, char *argv[])
{
V_NODE *root = NULL;
int pre[] = {400,200,100,300,500,600};
int mid[] = {100,200,300,400,500,600};
root = create_tree(pre, mid, 6);
while(1)
{
switch(menu())
{
case 1 : print_tree(root); break;
case 2 : root = insert_one_node(root); break;
case 3 : root = del_one_node(root); break;
case 4 : printf("depth:%d\n", get_depth(root)); break;
case 9 : return 0;
default : break;
}
}
return 0;
}