#include<stdio.h>
#include<stdlib.h>
typedef struct treenode
{
    int data;
    struct node*left;
    struct node*right;    
}node;
void insert(node*,int);
void del();

int BT_add()
{
    node *root=(node*)malloc(sizeof(node));
    root=NULL;
    int select;
    int data;
    while(1)
    {
       printf("\n------------Select Work:----------\n");
       printf("(0)Exit\n(1)Insert(2)Del");
       scanf("%d",&select);     
       if(select==0)
	   printf("\n");
       break;
       switch(select)
       {
         case 1:          
             printf("Insert Data:");
             scanf("%d",&data);
             insert(root,data);
             break;
         case 2:
             del();
             break;  
       }       
    }
    
      system("pause");
      return 0; 
}
void insert(node*r,int data)
{
     node *newnode =(node*)malloc(sizeof(node)); 
     newnode->left = newnode->right =NULL;
     newnode->data = data;
     if(r==NULL)
     {
         r = newnode;  
     }
     else
     {
         newnode = r;
         if(data<=r->data)
         {
             return insert(newnode->left,data);           
         }
         else
         {
             return insert(newnode->right,data);
         }
     }
     printf("%d Insert Success",data);
}
void del()
{
     
}