(Binary Tree)

Given the pre-order traversal and in-order traversal of a binary tree, output the post-order traversal of the binary tree.

Input format:

line 1: number of nodes

line 2: the pre-order traversal;

line 3: the in-order traversal.

note: The tree nodes are labeled 1, 2, ..., n

// Starting Code

#include

#include

typedefstructTreeNode{

intlabel;

TreeNode*left,*right;

}TreeNode;

usingnamespacestd;

intmain(){

intn;

cin>>n;

vectorpreorder(n);

for(inti=0;i>preorder[i];<>

vectorinorder(n);

for(inti=0;i>inorder[i];<>

vectorpostorder(n,-1);

//computeyourpostordertraversalinpostorder!

//outputthepostordertraversal

for(inti=0;i

cout

}

\f<>