|Tyvj|二叉树|P1441 求二叉树的先序序列

http://tyvj.cn/p/1441

#include<cstdio>#include<cstring>char in[20], post[20];void dg(int is, int ps, int l) {char root = post[ps+l-1];if (l==0) return ;putchar(root);int p=0;while (in[is+p]!=root && p<l-1) p++;dg(is, ps, p);dg(is+p+1, ps+p,   l-p-1);}int main() {scanf("%s", in); scanf("%s", post);dg(0,0, strlen(in));return 0;}