#include<iostream>
#include<iomanip>
#include<windows.h>
using namespace std;
typedef int elemtype;
typedef struct tree
{
elemtype data;
struct tree *left,*right;
}b_tree;
b_tree *Insert(b_tree *root,b_tree *newnode)
{
b_tree *currentnode;
b_tree *parentnode;
if(root==NULL)
return newnode;
else
{
currentnode=root;
while(currentnode!=NULL)
{
parentnode=currentnode;
if(currentnode->data >newnode->data)
currentnode=currentnode->left ;
else
currentnode=currentnode->right ;
}
if(parentnode->data >newnode->data)
parentnode->left=newnode;
else
parentnode->right=newnode;
}
return root;
}
b_tree *Creat(elemtype data[],int len)
{
int i;
b_tree *newnode;
b_tree *root=NULL;
for(i=0;i<len;i++)
{
newnode=new b_tree();
newnode->data =data[i];
newnode->left =NULL;
newnode->right =NULL;
root=Insert(root,newnode);
}
return root;
}
int Search(b_tree *root,elemtype node)
{
int flag=0;
b_tree *currentnode;
currentnode=root;
while(currentnode!=NULL)
{
if(currentnode->data==node)
{
