给定前序中序遍历，求后续遍历

问题：给定前序中序遍历，求后续遍历

 

解法一：由前序可得出根节点，由根节点可在中序序列中定位出左子树和右子树。根据分治思想，分别由左子树的前序序列和中序序列求出其后序序列，同样，由右子树的前序中序序列求出其后序序列。继续划分，直到子树足够小，可前序序列和中序序列直接求出后续序列。

 

原序列的后序序列 = {{左子树后序序列},{右子树后序序列},根}

 

/* * This program calculates the post-order of an binary tree by its * pre order and in_order. * * Sijie YANG 2010 */ #include <stdio.h> #include <stdlib.h> #include <string.h> #include <assert.h> #define NUM 100 /* return the post order by pre order and in order */ void get_post_order (char pre_order[], char in_order[], char post_order[], int num) { int i = 0; char root; if (pre_order==NULL || in_order==NULL || post_order==NULL || num <=0) return; if (num == 1) { assert (pre_order[0] == in_order[0]); post_order[0] = pre_order[0]; } else if (num == 2) { assert ((pre_order[0]==in_order[0] && pre_order[1]==in_order[1]) || (pre_order[0]==in_order[1] && pre_order[1]==in_order[0])); post_order[0] = pre_order[1]; post_order[1] = pre_order[0]; } else { root = pre_order[0]; for (i=0; i<num; i++) if (root == in_order[i]) break; assert (i < num); get_post_order(pre_order+1, in_order, post_order, i); get_post_order(pre_order+1+i, in_order+i+1, post_order+i, num-i-1); post_order[num-1] = root; } return; } void dump_order (char *order, int num) { int i; if (order == NULL || num <= 0) return; for (i=0; i<num; i++) printf ("%c ", order[i]); printf ("/n"); } /* test */ int main (int argc, char *argv[]) { char post[100]; char *pre; char *in; int len; /* * a */ pre = "a"; in = "a"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); printf ("/n"); /* * a * / * b */ pre = "ab"; in = "ba"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); printf ("/n"); /* * a * / * c */ pre = "ac"; in = "ac"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); printf ("/n"); /* a * / / * b c */ pre = "abc"; in = "bac"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); printf ("/n"); /* a * / * b * / * c * */ pre = "abc"; in = "cba"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); printf ("/n"); /* a * / * b * / * c */ pre = "abc"; in = "abc"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); printf ("/n"); /* a * / / * b e * // / * c f g * / / * d h */ pre = "abcdfegh"; in = "dcbfaghe"; len = strlen(pre); get_post_order (pre, in, post, len); dump_order (pre, len); dump_order (in, len); dump_order (post, len); /* dcfbhgea*/ printf ("/n"); return 0; }