二叉树遍历（c++代码）.docVIP

二叉树三种遍历： #includeiostream #includestring using namespace std; #define max 100 typedef struct btnode{ char data; struct btnode *lc, *rc; } *btree; bool prebtree(char pre[], int lp, int rp, char mid[], int lm, int rm, btree t)//前中求后 { if (lp rp || lm rm) //范围不对 return false; int len = 0; for (int i=lm; i=rm mid[i]!=pre[lp]; i++) len++; if (len rm - lm) //数据不对 return false; t = new btnode; t-lc = t-rc = NULL; bool flag = true; if (len 0) //有左孩子 flag = prebtree(pre, lp+1, lp+len, mid, lm, lm+len-1, t-lc); if (flag len rm - lm) //有右孩子 flag = prebtree(pre, lp+1+len, rp, mid, lm+len+1, rm, t-rc); if (flag) t-data = pre[lp]; else delete t; return flag; } bool postbtree(char post[], int lp, int rp, char mid[], int lm, int rm, btree t)//中后求前 { if (lp rp || lm rm) //范围不对 return false; int len = 0; for (int i=lm; i=rm mid[i]!=post[rp]; i++) len++; if (len rm - lm) //数据不对 return false; t = new btnode; t-lc = t-rc = NULL; bool flag = true; if (len 0) //有左孩子 flag = postbtree(post, lp, lp+len-1, mid, lm, lm+len-1, t-lc); if (flag len rm - lm) //有右孩子 flag = postbtree(post, lp+len, rp-1, mid, lm+len+1, rm, t-rc); if (flag) t-data = post[rp]; else delete t; return flag; } void preorder(btree p) { if(p != NULL) { cout p-data; preorder(p-lc); preorder(p-rc); } } void inorder(btree p) { if(p != NULL) { inorder(p-lc); cout p-data; inorder(p-rc); } } void postorder(btree p) { if(p != NULL) { postorder(p-lc); postorder(p-rc); cout p-data; } } int main(int argc, char* argv[]) { int a,i=0; string str1,str2,str3; char pre[max],mid[max