摘要：
/*已知二叉树的先序遍历序列和中序遍历序列，输出它的后序遍历序列． 输入：DBAFCEG FABCDEG 输出：FACBGED*/#include<iostream>#include<string>using namespace std;#define NULL 0typedef char TElementType;typedef struct BiTNode{ TElementType data; struct BiTNode*lchild,*rchild;}BiTNode,*BiTree;void CreateTree(BiTree &T,string pr 阅读全文
