#include "stdio.h"
#include "stdio.h"
#include <stdlib.h>
#include <iostream.h>
#include <process.h>
typedef char TElemType;
//--二叉树的二叉链表存储表示
typedef struct BiTNode
{ TElemType data;
struct BiTNode * lchild, *rchild;
} BiTNode, * BiTree;
//算法6.4 按先序遍历的顺序建立二叉链表P131
void CreateBiTree(BiTree &T)
{ TElemType ch;
cin>>ch;
if(ch=='#') T=NULL;
else
{ T=new BiTNode;
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
//先序遍历算法
void PreOrder(BiTree T )
{ if (T)
{ printf("%c ",T->data);
PreOrder(T->lchild);
PreOrder(T->rchild);
}
}
/*中序遍历的递归算法*/
void InOrder(BiTree T )
{
if (T)
{ InOrder(T->lchild);
cout<<T->data;
InOrder(T->rchild);
}
}
/*后序遍历递归算法*/
void PostOrder( BiTree T)
{
if (T)
{ PostOrder(T->lchild);
PostOrder(T->rchild);
cout<<T->data;
}
}
int main(int argc, char* argv[])
{ BiTree T;
printf("请按先序遍历输入一颗二叉树(用#表示一颗空树):\n");
CreateBiTree(T);
cout<<"先序遍历二叉树为:"<<endl;
PreOrder(T);
cout<<endl<<"中序序遍历二叉树为:"<<endl;
InOrder(T);
cout<<endl<<"后序遍历二叉树为:"<<endl;
PostOrder(T);
cout<<endl;
return 0;
}
望采纳!
追问这个输入要怎么输?
a
b c
d e f
如上树 先序为abdecf 应该怎么输?
追答abd##e##cf###,#表示为空
本回答被提问者和网友采纳