1138 Postorder Traversal(25 分)
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
思路:根据前序遍历和中序遍历还原树 后序遍历递归输出
#include<iostream>
#include<vector>
using namespace std;
const int max_size(100100);
int pre[max_size], ino[max_size];
vector<int>v;
struct node
{
int data;
node*lchild,*rchild;
};
node* buildtree(int preL, int preR, int inoL, int inoR)
{
if (preL > preR)return NULL;
int e = pre[preL],idx=inoL;
while (idx <= inoR && e != ino[idx])idx++;
node *root = new node;
root->data = e;
root->lchild = root->rchild = NULL;
int leftLength = idx - inoL;
int leftPreEnd = leftLength + preL;
root->lchild = buildtree(preL + 1, leftPreEnd, inoL, idx - 1);
root->rchild = buildtree(leftPreEnd + 1, preR, idx + 1, inoR);
return root;
}
void postorder(node*root)
{
if (root != NULL)
{
postorder(root->lchild);
postorder(root->rchild);
v.push_back(root->data);
return;
}
}
int main()
{
int n,i;
cin >> n;
for (i = 0; i < n; i++)scanf("%d", &pre[i]);
for (i = 0; i < n; i++)scanf("%d", &ino[i]);
node*root = buildtree(0, n - 1, 0, n - 1);
postorder(root);
cout << v[0]<<endl;
}