二叉排序树

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

typedef struct binary_sort_Tree{

int data;

struct binary_sort_Tree *left,*right;

}BSTNode;

BSTNode *insertBST(BSTNode *root,int num)

{

if(NULL == root)

{

root = (BSTNode *)malloc(sizeof(BSTNode));

root->data = num;

root->right = NULL;

root->left = NULL;

}else{

if(num < root->data)

{

root->left = insertBST(root->left,num);

}else{

root->right = insertBST(root->right,num);

}

}

return root;

}

BSTNode *create(BSTNode *root)

{

int num;

while(scanf("%d",&num))

{

root = insertBST(root,num);

}

return root;

}

void visit(BSTNode *root)

{

if(NULL == root) return ;

visit(root->left);

printf(" %d",root->data);

visit(root->right);

}

int main()

{

BSTNode *root = NULL;

root = create(root);

visit(root);

return 0;

}