树与二叉树实验2

#include<iostream.h>
struct BiNode
{
 char data;
BiNode *lchild,*rchild;
};
class BiTree
{
public:
BiTree(){root=Creat(root);}  
~BiTree(){Release(root);}  
void PreOrder(){PreOrder(root);}  
void InOrder(){InOrder(root);}  
void PostOrder(){PostOrder(root);}  
void Count(){Count(root);}
void CountLeaf(){CountLeaf(root);} 
private:
BiNode *root;  
BiNode *Creat(BiNode *bt); 
void Release(BiNode *bt); 
void PreOrder(BiNode *bt); 
void InOrder(BiNode *bt); 
void PostOrder(BiNode *bt);
void Count(BiNode *bt); 
void CountLeaf(BiNode *bt);
};

int count=0;
BiNode *BiTree::Creat(BiNode *bt)
{
char ch; 
cout<<"请输入创建一颗二叉树的结点数据"<<endl;
cin>>ch;  
if(ch=='#')return NULL;
else
{
bt=new BiNode;  bt->data=ch; 
bt->lchild=Creat(bt->lchild); 
bt->rchild=Creat(bt->rchild); 
}
return bt;
}
void BiTree::Release(BiNode *bt)
{
if(bt!=NULL)
{
Release(bt->lchild);  
Release(bt->rchild);  
delete bt;
}
}

void BiTree::PreOrder(BiNode *bt)
{
if(bt==NULL)return; 
else
{
cout<<bt->data<<" ";  
PreOrder(bt->lchild); 
PreOrder(bt->rchild); 
}
}

void BiTree::InOrder(BiNode *bt)
{
    if(bt==NULL)return; 
else
{
InOrder(bt->lchild); 
cout<<bt->data<<" "; 
InOrder(bt->rchild);
}
}

void BiTree::PostOrder(BiNode *bt)
{
if(bt==NULL)return; 
else
{
PostOrder(bt->lchild); 
PostOrder(bt->rchild); 
cout<<bt->data<<" ";   
}
}

void BiTree::Count(BiNode *bt)
{
if(bt!=NULL)
{
Count(bt->lchild);
count++;
Count(bt->rchild);
cout<<count<<" ";
}
}

void BiTree::CountLeaf(BiNode *bt)
{
if(bt->lchild==NULL && bt->rchild==NULL)
{
count++;
CountLeaf(bt->lchild);
CountLeaf(bt->rchild);
}
cout<<count;
}

int main()
{
BiTree T;
cout<<"前序遍历：";
T.PreOrder();
cout<<endl;
cout<<"中序遍历：";
T.InOrder();
cout<<endl;
cout<<"后序遍历：";
T.PostOrder();
cout<<endl;
cout<<"结点数：";
T.Count();
cout<<endl;
cout<<"叶子结点数：";
T.CountLeaf();
cout<<endl;
return 0;
}