[NOIP 2001PJ]求二叉树的先序序列

代码 #include <cstdio> #include <cstring> #define M 20 char zx[M],hx[M]; int zxl,hxl; void solve(char root, int l, int r) { if (l <= r) { printf("%c", root); int p, q; for

>>阅读原文<<