Hdu Binary Tree Traversals (二)
{
if(root)
{
PostTravel(root->Left);
PostTravel(root->Right);
printf("%d ",root->data);
}
}
int main()
{
int i,n;
BiTree root;
while(scanf("%d",&n)!=EOF)
{
for(i = 1;i <= n;i++)
scanf("%d",&pre[i]);
for(i = 1;i <= n;i++)
scanf("%d",&in[i]);
BuildTree(root,n,1,n,1,n);
PostTravel(root->
Left);
PostTravel(root->Right);
printf("%d\n",root->data);
}
return 0;
}