#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <cmath>
#include <algorithm>
#include <string>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;
struct node
{
int data;
int lchild;
int rchild;
}Node[110];
int N,a[110],index=0,c=0;
void inorder(int root)
{
if(root==-1)return;
inorder(Node[root].lchild);
Node[root].data=a[index++];
inorder(Node[root].rchild);
}
void levelorder(int root)
{
queue<int> q;
q.push(root);
while(!q.empty())
{
int top=q.front();
q.pop();
printf("%d",Node[top].data);
if(c!=N-1)printf(" ");
c++;
if(Node[top].lchild!=-1)q.push(Node[top].lchild);
if(Node[top].rchild!=-1)q.push(Node[top].rchild);
}
}
int main()
{
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%d%d",&Node[i].lchild,&Node[i].rchild);
}
for(int i=0;i<N;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+N);
inorder(0);
levelorder(0);
system("pause");
return 0;
}
PAT甲1099. Build A Binary Search Tree (30)
猜你喜欢
转载自blog.csdn.net/yhy489275918/article/details/80172562
今日推荐
周排行