二叉排序树的建立和遍历

#include<stdio.h>
#include<stdlib.h>

 

typedef struct node{
      int data;
      struct node *left,*right;
}node;

node *create(node *tree,int n)
{
      node *p=(node *)malloc(sizeof(node));
      p->data=n;
      p->left=p->right=NULL;
      if(!tree) return p;
      else{
            if(p->data<tree->data)
             tree->left=create(tree->left,n);
            else tree->right=create(tree->right,n);
            return tree;
      }
}

 

void display(node *tree)
{
      if(tree->left!=NULL) display(tree->left);
      printf("%d/t",tree->data);
      if(tree->right!=NULL) display(tree->right);
}

void main()
{
      node *t=NULL;
      int i,a[100];
      printf("please input numbers end with 0:/n");
      for(i=0;;i++)
      {
            scanf("%d",&a[i]);
            if(a[i]==0) break;
            else t=create(t,a[i]);
      }
      display(t);
      printf("/n");
      getchar();
      getchar();
}