struct BiNode
{
char data;
BiNode *lchild,*rchild;
};
class BiTree
{
public:
BiTree(){root=Create(root);}
~BiTree(){Release(root);}
void Preorder(){Preorder(root);}
void Inorder(){Inorder(root);}
void Postorder(){Postorder(root);}
private:
BiNode *root;
BiNode *Create(BiNode *bt);
void Release(BiNode *bt);
void Preorder(BiNode *bt);
void Inorder(BiNode *bt);
void Postorder(BiNode *bt);
};
BiNode *BiTree::Create(BiNode *bt)
{
char ch;
cin>>ch;
if(ch=='#')return NULL;
else {
bt=new BiNode;
bt->data=ch;
bt->lchild=Create(bt->lchild);
bt->rchild=Create(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<<" ";
}
}
int main()
{
cout<<endl;
cout<<"请输入二叉树的结点数据;"<<endl<<endl;
BiTree T;
cout<<endl;
cout<<"前序遍历:"<<endl;
T.Preorder();
cout<<endl;
cout<<"中序遍历:"<<endl;
T.Inorder();
cout<<endl;
cout<<"后序遍历:"<<endl;
T.Postorder();
cout<<endl;
return 0;
}
#include<iostream.h>
const int MaxSize=100;
class BiTree
{
public:
BiTree(char a[],int n);
~BiTree(){}
void Print();
void PCM();
void LM();
private:
char data[MaxSize];
int length;
};
BiTree::BiTree(char a[],int n)
{
if(n>MaxSize||n<1) throw"参数非法";
for(int i=0;i<n;i++)
data[i]=a[i];
length=n;
}
void BiTree::Print()
{
for(int i=0;i<length;i++)
{
if(data[i]!='\0')
cout<<data[i];
}
cout<<endl;
}
void BiTree::PCM()
{
for(int i=1;i<=length;i++)
{
int l=2*i;
int r=2*i+1;
int p=i/2;
if(data[i-1]!='\0')
{
cout<<"结点"<<i<<"为"<<data[i-1]<<endl;
if(p>=1&&data[p-1]!='\0')
cout<<"结点"<<i<<"的双亲为"<<data[p-1]<<endl;
else
cout<<"结点"<<i<<"无双亲"<<endl;
if(data[l-1]!='\0'&&l<length)
cout<<"结点"<<i<<"的左孩子为"<<data[l-1]<<endl;
else
cout<<"结点"<<i<<"无左孩子"<<endl;
if(data[r-1]!='\0'&&r<length)
cout<<"结点"<<i<<"的右孩子为"<<data[r-1]<<endl;
else
cout<<"结点"<<i<<"无右孩子"<<endl;
}
cout<<endl;
}
}
void BiTree::LM()
{
for(int i=1;i<=length;i++)
{
int l=2*i;
int r=2*i+1;
if(l>length&&data[i-1]!='\0')
cout<<data[i-1]<<" ";
}
}
void main()
{
char a[7]={'A','B','\0','\0','C','\0','D'};
BiTree t(a,7);
cout<<"层序输出结点数据为:";
t.Print();
cout<<endl;
t.PCM();
cout<<endl;
cout<<"所有叶子结点为:";
t.LM();
system("pause");
}