实验四：二叉树层序遍历



#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);}
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;
 }
}
int main()
{
 BiTree T;
 cout<<"----层序遍历----"<<endl;
 T.LeverOrder();
 cout<<endl;
 return 0;
}