二叉查找树（c++）

二叉查找数的操作：

#include <iostream>

using namespace std;

typedef struct BitNode
{
    int data;
    struct BitNode *lChild,*rChild;
}BitNode;

int main()
{
    void InitTree(BitNode *&BitTree);
    int PrintTree(BitNode *BitTree);
    int SearchNode(BitNode *BitTree,int x);
    int InsertNode(BitNode *&BitTree,int x);
    int depthtree(BitNode *&BitTree);
    BitNode *BitTree;
    int dep=0;
    BitTree=new BitNode;
    InitTree(BitTree);
    PrintTree(BitTree);
    SearchNode(BitTree,4);
    InsertNode(BitTree,5);
    InsertNode(BitTree,6);
    PrintTree(BitTree);
    dep=depthtree(BitTree);
    cout<<"二叉查找树的高度是："<<dep<<endl;
    return 0;
}

void InitTree(BitNode *&BitTree)
{
    BitNode *pl,*pr;
    BitTree->data=7;
    pl=new BitNode;
    pl->data=4;
    pl->lChild=pl->rChild=NULL;
    BitTree->lChild=pl;
    pr=new BitNode;
    pr->data=8;
    pr->lChild=pr->rChild=NULL;
    BitTree->rChild=pr;
}

int PrintTree(BitNode *BitTree)
{
    if(BitTree)
    {
        cout<<BitTree->data<<endl;
        PrintTree(BitTree->lChild);
        PrintTree(BitTree->rChild);
    }
    return 0;
}
int SearchNode(BitNode *BitTree,int x)
{
    while(BitTree)
    {
        if(BitTree->data==x)
        {
            cout<<"find x="<<x<<endl;
            return 1;
        }
        if(x<BitTree->data)
        BitTree=BitTree->lChild;
        else
        BitTree=BitTree->rChild;
    }
    cout<<"cannot find x="<<x<<endl;
    return 0;
}
int InsertNode(BitNode *&BitTree,int x)
{
    if(BitTree==NULL)
    {
        BitNode *p;
        p=new BitNode;
        p->data=x;
        p->lChild=p->rChild=NULL;
        BitTree=p;
        cout<<"insert successfully"<<endl;
        return 1;
    }
    else if(x<BitTree->data)
    {
        InsertNode(BitTree->lChild,x);
    }
    else
    {
         InsertNode(BitTree->rChild,x);
    }
    return 0;
}

int depthtree(BitNode *&BitTree)
{
    int dr=0,dl=0;
    if(BitTree==NULL)
    return 0;
    dr=1+depthtree(BitTree->rChild);
    dl=1+depthtree(BitTree->lChild);
    return dr>=dl?dr:dl;
}

共勉。