9二叉树的链式存储结构的操作.cpp

来自「数据结构的C＋＋表述」· C++ 代码 · 共 59 行

#include <iostream.h>
struct BiTree
{
	char data;
	BiTree *lchild,*rchild;
};
void Create(BiTree* &t)
{
	char a;
	cin>>a;
	t=new BiTree;
	if(a=='#')
		t=NULL;
	else
	{
		t->data=a;
		Create(t->lchild);
		Create(t->rchild);
	}
	return;
}

void PreOrder(BiTree *bt)
{
	if(bt==NULL)
		return;
	cout<<bt->data<<" ";
	PreOrder(bt->lchild);
	PreOrder(bt->rchild);
}
void InOrder(BiTree *bt)
{
	if(bt==NULL)
		return;
	InOrder(bt->lchild);
	cout<<bt->data<<" ";
	InOrder(bt->rchild);
}
void PostOrder(BiTree *bt)
{
	if(bt==NULL)
		return;
	PostOrder(bt->lchild);
	PostOrder(bt->rchild);
	cout<<bt->data<<" ";
}
void main()
{
	BiTree *t;
	cout<<"创建一二叉树，请输入数据："<<endl;
	Create(t);
	cout<<"先序遍历：";
	PreOrder(t);
	cout<<endl<<"中序遍历：";
	InOrder(t);
	cout<<endl<<"后序遍历：";
	PostOrder(t);
	cout<<endl;
}