#include
typedef struct node
{
node *leftChild;
node *rightChild;
char data;
node(){}
} *BiTree;
void createBiTree(BiTree &T)//建立二叉树{
char c;
cin >> c;
if('#' == c)
T = NULL;
else
{
T = new node;
T->data =c;
createBiTree(T->leftChild);
createBiTree(T->rightChild);
}
}
void prelook(BiTree &T)//前序遍历
{
if(T!=NULL)
{
if(T->data>='a'&&T->data<='z')
cout<data<<">";
prelook(T->leftChild);
prelook(T->rightChild);
}
}
void midlook(BiTree &T)//中序遍历{
if(T!=NULL)
{
midlook(T->leftChild);
if(T->data>='a'&&T->data<='z')
cout<data<<">";
midlook(T->rightChild);
}
}
void lastlook(BiTree &T)//后续遍历
{
if(T!=NULL)
{
lastlook(T->leftChild);
lastlook(T->rightChild);
if(T->data>='a'&&T->data<='z')
cout<data<<">";
}
}
int main()
{
cout<<"请输入二叉树的前序。例如ab#d##c#e##"<BiTree T;
BiTree p=T;
createBiTree(T);
prelook(T);cout<midlook(T);cout<lastlook(T);cout<return 0;
}
