-
Notifications
You must be signed in to change notification settings - Fork 0
/
jobdu_1201_kaoyan_35.c
73 lines (66 loc) · 1.54 KB
/
jobdu_1201_kaoyan_35.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
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct TreeNode {
int value;
struct TreeNode *lchild;
struct TreeNode *rchild;
};
struct TreeNode* insertTreeNode(struct TreeNode *T, int value)
{
if (T == NULL) {
T = (struct TreeNode*)malloc(sizeof(struct TreeNode));
T->value = value;
T->lchild = NULL;
T->rchild = NULL;
}
else if (value < T->value)
T->lchild = insertTreeNode(T->lchild, value);
else if (value > T->value)
T->rchild = insertTreeNode(T->rchild, value);
return T;
}
void printPreOrder(struct TreeNode *T)
{
if (T != NULL) {
printf("%d ", T->value);
printPreOrder(T->lchild);
printPreOrder(T->rchild);
}
}
void printMidOrder(struct TreeNode *T)
{
if (T != NULL) {
printMidOrder(T->lchild);
printf("%d ", T->value);
printMidOrder(T->rchild);
}
}
void printPostOrder(struct TreeNode *T)
{
if (T != NULL) {
printPostOrder(T->lchild);
printPostOrder(T->rchild);
printf("%d ", T->value);
}
}
int main(int argc, char**argv) {
int n, i;
int array[110];
while (scanf("%d", &n) != EOF) {
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
struct TreeNode *T = NULL;
for (i = 0; i < n; i++) {
T = insertTreeNode(T, array[i]);
}
printPreOrder(T);
printf("\n");
printMidOrder(T);
printf("\n");
printPostOrder(T);
printf("\n");
}
return 0;
}