实验 五：树和二叉树的实验

#include<iostream.h>
struct BiNode
{
 char data; 
 BiNode *lchild,*rchild;
};
class BiTree
{
 BiNode *root;
 BiNode *Creat(BiNode *bt);
 void Release(BiNode *bt);
 void PreOrder(BiNode *bt);
 void InOrder(BiNode *bt);  
 void PostOrder(BiNode *bt);  
 void Print(BiNode *bt,BiNode *pr);
 void BiTree::Printleaf(BiNode *bt);
public:
 BiTree(){root=Creat(root);}
 ~BiTree(){Release(root);}  
 void PreOrder(){PreOrder(root);} 
 void InOrder(){InOrder(root);} 
 void PostOrder(){PostOrder(root);}      
    void Print(){Print(root,NULL);} 
    void Printleaf(){Printleaf(root);} 
};
BiNode *BiTree::Creat(BiNode *bt)
{
 char ch;
 cin>>ch;
 if(ch=='#')  bt=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<<" "; 
  InOrder(bt->lchild);     
  InOrder(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::Print(BiNode *bt,BiNode *pr) 
{ 
    if(bt==NULL)return;
    { 
        cout<<"结点"<<bt->data<<"    ";  
        if(bt->lchild!=NULL)
            cout<<"左孩子："<<bt->lchild->data<<"    ";    
        else   
            cout<<"无左孩子"<<"       ";   
        if(bt->rchild!=NULL)   
            cout<<"右孩子："<<bt->rchild->data<<"    ";
        else   
            cout<<"无右孩子"<<"       ";   
        if(pr!=NULL)   
            cout<<"双亲："<<pr->data<<"    ";
        else   
            cout<<"无双亲"<<"        ";   
        cout<<endl;   
        Print(bt->lchild,bt);   
        Print(bt->rchild,bt);   
    }   
}
void BiTree::Printleaf(BiNode *bt)  
{ 
    if(bt!=NULL)    
    {      
        if(bt->lchild==NULL&&bt->rchild==NULL)
            cout<<bt->data<<"  "; 
        Printleaf(bt->lchild); 
        Printleaf(bt->rchild); 
    }   
}   
int main()
{
 cout<<"二叉树及实现其相关操作："<<endl;
 BiTree T;       
 cout<<"-------前序遍历-------"<<endl;
 T.PreOrder();
 cout<<endl;
 cout<<"-------中序遍历-------"<<endl;
 T.InOrder();
 cout<<endl;
 cout<<"-------后序遍历-------"<<endl;
 T.PostOrder();
 cout<<endl;
 cout<<"各结点的双亲和孩子信息："<<endl; 
    T.Print(); 
    cout<<endl; 
    cout<<"叶子结点信息："; 
    T.Printleaf(); 
    cout<<endl; 
 return 0;
}