摘要： #include <stdio.h>#include <string.h>#define maxn 1000//const int maxn = 1000;int lch[maxn], rch[maxn]; char op[maxn];int nc = 0;int build_tree(char *s, int x, int y){ int i, c1 = -1, c2 = -1, p = 0; int u; if(y-x == 1){ u = ++nc; lch[u] = rch[u] = 0; op[u] = s[x]; retu... 阅读全文