7)查找[2]二叉排序树以及查找

#include "iostream"
#include "iomanip"
#include "time.h"
using namespace std;

#define num 13

struct Bnode{
    int data;
    Bnode *lchild;
    Bnode *rchild;
};

/*
*将指针S所指的结点插入到二叉排序树T中
*/
void insert(Bnode * &Tree,Bnode *S)
{
    if(Tree==NULL)//插入到空树时，插入结点为根结点
    {
        Tree = S;
    }else if(S->data<Tree->data){    
        insert(Tree->lchild,S);//插入到Tree的左子树中
    }else {
        insert(Tree->rchild,S);//插入到Tree的右子树中
    }
}

/*
*二叉排序树的构造
*/
void create_bst(int A[],int n,Bnode *&Tree)
{
    int i=0;
    Tree = NULL;
    while(i<n)
    {
        Bnode *u = new Bnode;
        u->data = A[i];
        u->lchild = NULL;
        u->rchild = NULL;
        insert(Tree,u);
        i++;
    }
}

/*
*二叉排序树的查找
*/
Bnode *bst_search(Bnode *T,int x)
{
    if((T==NULL)||(T->data = x))
    {
        cout<<"Address:"<<T<<",data:"<<T->data <<endl;
        return T;
    }
    else if(x<T->data){
        return bst_search(T->lchild,x);
    }else return bst_search(T->rchild,x);
}

/*
*中序输出
*/
void inorder(Bnode *Tree)
{
    if(Tree!=NULL)
    {
        inorder(Tree->lchild);
        cout<<setw(4)<<Tree->data<<" ";
        inorder(Tree->rchild);
    }
}

int main()
{
    Bnode *Tree =new Bnode;
    time_t start ,end;
    int A[]={100,60,40,80,70,90,150,120,180,110,130,160,200};
    cout<<"initialize Array:"<<endl;
    for(int i=0;i<num;i++)cout<<setw(5)<<A[i];
    cout<<endl;
    create_bst(A,num,Tree);//创建二叉树
    cout<<"中序输出二叉树Tree:"<<endl;
    inorder(Tree);
    cout<<endl;
    start =clock();
    bst_search(Tree,A[5]);//二叉树查找
    end = clock();
    cout<<"time:"<<(double)(end-start)/1000<<"S"<<endl;
    return 0;
}