1138 Postorder Traversal (25point(s)) - C语言 PAT 甲级

1138 Postorder Traversal (25point(s))

Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the corresponding binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 50,000), the total number of nodes in the binary tree. The second line gives the preorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the first number of the postorder traversal sequence of the corresponding binary tree.

Sample Input:

7
1 2 3 4 5 6 7
2 3 1 5 4 7 6

Sample Output:

3

题目大意：

输入 N 个节点的树，给出先序序列和中序序列

输出后序序列的第一个节点

设计思路：

后序遍历的第一个节点一定是最左最下的那个节点

• 若左子树存在，则一定在左子树中
• 若左子树不存在，右子树存在，则一定在右子树，即一定在右子树的左子树中
• 若遍历到第一个叶节点，则为后序遍历的第一个节点

编译器：C (gcc)

设计思路：
[1079 延迟的回文数（C语言）](https://blog.csdn.net/huaxuewan/article/details/88777961)
* 此题难点在于大数的相加。思路是让数组存数字时，个位数在数组低位 a[0] 上，此时两数相加可直接进位，省去进位移动数组的麻烦
1. 读取初始值时特殊处理一次即可
2. 利用自定义函数逆转数组，输出数组即可