实验四：二叉树输出各个结点和双亲、孩子结点信息

#include<iostream.h>
const int count=0;
struct BiNode
{
 char data;
 BiNode *lchild,*rchild;
};
char s[100];
class BiTree
{
public:
 BiTree(){root=Creat(root);}
    ~BiTree(){Release(root);}
 void LeverOrder(){LevelOder(root);}
 void Message(int x);      
 void Leaves();         
private:
 BiNode *root(BiNode *bt);
 BiNode *Creat(BiNode *bt);
 void Release(BiNode *bt);
    void LeverOrder(BiNode *bt); 
};
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::LeverOder(BiNode *bt)
{
 int front,rear;
 front=rear=-1;
 if(root==NULL) return;
 Q[++rear]=root;
 while(front!=rear)
 {
  q=Q[++front];
  cout<<q->data;
  if(q->lchild!=NULL) Q[++rear]=q->lchild;
        if(q->rchild!=NULL) Q[++rear]=q->rchild;
 }
}
void Btree::Message(int i)             
{
        int t;
 while(t)
 {
  cout<<"\t\t\t请输入数字(1-"<<length<<")查找结点：";
  cin>>i;
  if(a[i]=='#'||i>length) cout<<"\t\t\t该结点不存在！";
  else
  {
       cout<<"\t\t\t该结点信息："<<a[i]<<endl;
  cout<<"\t\t\t该结点的双亲结点信息："<<a[i/2]<<endl;
    if(a[2*i]=='#'||(2*i)>length)
       cout<<"\t\t\t该结点无左孩子！"<<endl;
      else  cout<<"\t\t\t该结点的左孩子结点信息："<<a[2*i]<<endl; 
  if(a[2*i+1]=='#'||(2*i+1)>length)
       cout<<"\t\t\t该结点无右孩子！"<<endl;
       else  cout<<"\t\t\t该结点的右孩子结点信息："<<a[2*i+1]<<endl; 
         }
        cout<<"\t\t\t是否继续查找(1/0)：";
     cin>>t;
        cout<<endl;  
 }
 
}

void Btree::Leaves()
{
 if(a[1]!='0')
 {
     cout<<"\t\t\t叶子结点为：";
  for(int i=1;i<=length;i++)
     {
  if((a[2*i]=='#'&&a[2*i+1]=='#')||((2*i+1)>length&&(2*i)>length)&&a[i]!='#')
  cout<<a[i]<<" ";
     }
     cout<<endl;
 }
 else cout<<"\t\t\t该树为空！";
}
 
int main()
{
 BiTree T;
 cout<<"----层序遍历----"<<endl;
 T.LeverOrder();
 cout<<endl;
 return 0;
}