二叉树的基本操作

《二叉树的基本操作》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、#include    #definelchildl    #definerchildr    usingnamespacestd;    structBiNode    {        intdata;        BiNode*l;        BiNode*r;    };           classBiTree    {    public:        BiTree(){root=NULL;}        /*BiTree(BiNode*root)  

2、      {            this->root=root;            Creat(this->root);        }*/       ~BiTree()        {Release(root);};        voidPreOrder(BiNode*root);        voidInOrder(BiNode*root);        voidPostOrder(BiNode*root);        voidLevelOrder(BiNode*r

3、oot);        BiNode*Creat(BiNode*root);    private:                   BiNode*root;        voidRelease(BiNode*root);    };    /*BiTree::BiTree(BiNode*root)    {        Creat(root);    }*/          BiNode*BiTree::Creat(BiNode*root)    {                

4、   intch;        //BiNode*ro=root;         cin>>ch;        if(ch==0)            root=NULL;        else{            root=newBiNode;            root->data=ch;            root->l=Creat(root->l);            root->rchild=Creat(root->rchild);        }  

5、      returnroot;    }           /*    BiTree::~BiTree(BiNode*root)    {    Release(root);    }*/   voidBiTree::Release(BiNode*root)    {        //BiNode*ro=root;        if(root!=NULL){            Release(root->l);            Release(root->r

6、child);            deleteroot;        }    }    voidBiTree::PreOrder(BiNode*root)    {        if(root!=NULL){            //BiNode*ro=root;            cout<data;            cout<<"";            PreOrder(root->l);            PreOrder(root->rc

7、hild);        }    }    voidBiTree::InOrder(BiNode*root)    {        if(root!=NULL)         {            //BiNode*ro=root;            InOrder(root->l);            cout<data<<"";            InOrder(root->rchild);        }    }           void

8、BiTree::PostOrder(BiNode*root)    {        if(root!=NULL)         {            //BiNode*ro=root;             PostOrder(root->l);            PostOrder(root->rchild);            cout<data<<"";        }    }           voidBiTree::LevelOrder(Bi