/*中國系統分析員顧問團，http://www.csai.cn*/
/*程序員下午考試指南書籍源碼*/

#include <stdio.h>
#include <malloc.h>
typedef struct node{
int data;	/*結點的鍵值*/
struct node *left;
struct node *right;
}BTREE;

BTREE *SortTreeSearch(BTREE *tree,int d){
BTREE  *ptr = tree;
while(ptr != NULL && d != ptr->data){
if(d < ptr->data)
ptr = ptr ->left;
else
ptr = ptr->right;
}
return ptr;
}


void SortTreelnsert(BTREE **tree,BTREE *S){
if (*tree == NULL)  *tree = S;
else if (S->data < (*tree)->data)
SortTreelnsert(&((*tree)->left),S);
else if (S->data > (*tree)->data)
SortTreelnsert(&((*tree)->right), S);
}

main(){
	BTREE *mytree,*node;
int a[]={2,8,9,7,6,5},i;
  mytree=NULL;
  for(i=0;i<6;i++)
  {
  node=(BTREE *)malloc(sizeof(BTREE));
  node->data=a[i];
  node->left=node->right=NULL;
  SortTreelnsert(&mytree,node);
  }
  node=SortTreeSearch(mytree,6);
  if (node!=NULL)
  printf("Success!!!");
}