The order of a Tree
As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely:
1. insert a key k to a empty tree, then the tree become a tree with
only one node;
2. insert a key k to a nonempty tree, if k is less than the root ,insert
it to the left sub-tree;else insert k to the right sub-tree.
We call the order of keys we insert “the order of a tree”,your task is,given a oder of a tree, find the order of a tree with the least lexicographic order that generate the same tree.Two trees are the same if and only if they have the same shape.
Input
There are multiple test cases in an input file. The first line of each testcase is an integer n(n <= 100,000),represent the number of nodes.The second line has n intergers,k1 to kn,represent the order of a tree.To make if more simple, k1 to kn is a sequence of 1 to n.
Output
One line with n intergers, which are the order of a tree that generate the same tree with the least lexicographic.
Sample Input
4 1 3 4 2
Sample Output
1 3 2 4
题解:题意给出一个序列,构造一棵二叉搜索树,让你找一个序列,满足:能构成与给出的序列相同的二叉搜索树,同时,字典 序最小。输入一个序列构造二叉搜索树,输出二叉树序列的先序遍历即可。
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int map[100010],left[100010],right[100010];
int sum[100010],l1,l2,num;
void tree(int l,int k)
{
if(map[l]>=k)//判断能否放在左子树
{
if(left[l])//位子上是否已经放了数
tree(left[l],k);
else
left[l]=l2;//标记已经放了数
}
else//放在右子树上
{
if(right[l])
tree(right[l],k);
else
right[l]=l2;
}
}
void check(int l)
{
sum[num++]=map[l];//储存放数的顺序
if(left[l])//检查树是否已经建好
check(left[l]);
if(right[l])
check(right[l]);
}
int main()
{
int n;
while(~scanf("%d",&n))
{
int i,j,k;
memset(left,0,sizeof(left));
memset(right,0,sizeof(right));
l1=-1;l2=0;
num=0;
for(i=0;i<n;i++)
{
scanf("%d",&k);
if(l1==-1)
map[++l1]=k;
else
{
map[++l2]=k;
tree(l1,k);
}
}
check(l1);
for(i=0;i<num;i++)
{
if(i==0)
printf("%d",sum[i]);
else
printf(" %d",sum[i]);
}
printf("\n");
}
}