1 #include <stdio.h>
2 /****
3 * 此算法为满二叉树通过先序遍历数组获得后序遍历数组
4 ***/
5 // a[]为pre数组，b[]为post数组
6 void get_lrn_by_nlr(char a[], int a_left, int a_right, char b[], int b_left, int b_right)
7 {
8 if (a_right >= a_left)
9 {
10 b[b_right] = a[a_left];
11 get_lrn_by_nlr(a, a_left + (a_right - a_left) / 2 + 1, a_right, b, b_left + (b_right - b_left) / 2, b_right - 1);
12 get_lrn_by_nlr(a, a_left + 1, a_left + (a_right - a_left) / 2, b, b_left, b_left + (b_right - b_left) / 2 - 1);
13 }
14 }
15
16 int main()
17 {
18 char a[] = {'A', 'B', 'C', 'D', 'E', 'F', 'G'}, b[7];
19 get_lrn_by_nlr(a, 0, 6, b, 0, 6);
20 for (int i = 0; i < 7; i++)
21 printf("%c ", b[i]);
22 return 0;
23 }
