题目描述: 输入一棵树的先序遍历和中序遍历序列,输出后序遍历序列 AC代码: #include<cstdio> #include<cstring> const int MAX_N = 30; char pre_order[MAX_N], in_order[MAX_N]; int lch[MAX_N], rch[MAX_N]; char root; //根据前序 L1~R1, 中序 L2~R2构造二叉树 int build(int L1, int R1, int L2, int R2)