学步园

给出先序中序求后序；先找到根节点；

#include<cstdio><br /> #include<cmath><br /> #include<cstdlib><br /> #include<algorithm><br /> using namespace std;<br /> void build_tree(int n,int *a,int *b,int *c)<br /> { int *p=b;<br /> if(n<=0)<br /> return;<br /> while(2)<br /> {<br /> if(a[0]==*p)<br /> {<br /> break;<br /> }else p++;<br /> }<br /> int tt=p-b;<br /> build_tree(tt,a+1,b,c);<br /> build_tree(n-tt-1,a+tt+1,b+tt+1,c+tt);<br /> c[n-1]=a[0];<br /> }<br /> int main()<br /> { int n;<br /> while(~scanf("%d",&n))<br /> {<br /> int a[1002],b[1002],c[1002];<br /> for(int i=0;i<n;i++)<br /> {<br /> scanf("%d",&a[i]);<br /> }<br /> for(int i=0;i<n;i++)<br /> {<br /> scanf("%d",&b[i]);<br /> }<br /> build_tree(n,a,b,c);</p> <p> for(int i=0;i<n-1;i++)<br /> {<br /> printf("%d ",c[i]);<br /> } printf("%d\n",c[n-1]);<br /> }<br /> return 0;<br /> }<br />