#include <stdlib.h>
#include <stdio.h>
typedef struct Btree {
int value;
struct Btree *left;
struct Btree *right;
} Btree;
Btree *create_tree(int value) {
Btree *node = (Btree *) malloc(sizeof(Btree));
if (node == NULL) {
exit(-1);
}
node->value = value;
node->left = NULL;
node->right = NULL;
return node;
}
Btree *insert_tree(Btree *node, int value) {
if (node == NULL) {
return create_tree(value);
}
if (node->value == value) {
return node;
} else if (value < node->value) {
if (node->left == NULL) {
node->left = create_tree(value);
} else {
insert_tree(node->left, value);
}
} else {
if (node->right == NULL) {
node->right = create_tree(value);
} else {
insert_tree(node->right, value);
}
}
return node;
}
void display(Btree *node) {
if (node == NULL) {
return;
}
display(node->left);
printf("%d ", node->value);
display(node->right);
}
int main() {
int n;
while (scanf("%d", &n) != EOF) {
int num, i;
Btree *node = NULL;
for (i = 0; i < n; i++) {
scanf("%d", &num);
if (node == NULL) {
node = create_tree(num);
} else {
insert_tree(node, num);
}
}
printf("sort:");
display(node);
printf("\n");
}
return 0;
}
输入样例1:
5
3 2 1 4 5
输入样例2:
12
23 34 2 21 45 7 8 0 90 99 15 100
可多组输入,符合牛客OJ输入样式
5
3 2 1 4 5
sort:1 2 3 4 5
12
23 34 2 21 45 7 8 0 90 99 15 100
sort:0 2 7 8 15 21 23 34 45 90 99 100