#include
#include
#include
typedef struct tree {
int number;
struct tree * left;
struct tree * right;
}Tree;
Tree * TreeInsert(Tree * T,int n) {
if (T == NULL) {
T = (Tree *)malloc(sizeof(Tree));
if (T == NULL) {
printf("Out of space!");
return NULL;
}
else {
T->number = n;
T->left = T->right = NULL;
}
}
else if (T&&(n < T->number)) {
TreeInsert(T->left, n);
}
else if(T && (n > T->number)){
TreeInsert(T->right,n);
}
return T;
}
void main() {
int temp, n, i = 0;
printf("please input a number:");
scanf("%d", &n);
Tree * Ntree;
for (i = 0;i < n;i++) {
printf("Now please input a number:");
scanf("%d", &temp);
TreeInsert(Ntree, temp);
}
}