二叉樹遍歷：已知前序和中序，求後序

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1000 typedef struct node{ char d; struct node *lchild,*rchild; }Tnode; void MK(char in[],int is,int ie,char pre[],int pres,i

>>阅读原文<<