问题:
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
题意:
给你一个二叉搜索树,就是比父亲节点小的插入到父亲节点的左边,否则插入到右边,然后让你按照字典序最小的原则改变这个树的插入顺序,使树的形状保持不变。
思路:
就是先把树建好之后,按照先序遍历顺序输出出来。
代码:
#define N 6010
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,c,flag;
struct node
{
int a;
node *l,*r;
};
node *shu(node *root)//建树
{
if(root==NULL)
{
node *p=new node;
p->a=c;
p->l=NULL;
p->r=NULL;
return p;
}
if(c<root->a)
root->l=shu(root->l);
else
root->r=shu(root->r);
return root;
}
void PreOrder(node *root)//先序遍历
{
if(root!=NULL)
{
if(flag==1)
printf(" %d",root->a);
else
{
printf("%d",root->a);flag=1;
}
PreOrder(root->l);
PreOrder(root->r);
}
}
int main()
{
while(~scanf("%d",&n))
{
node *root=NULL;
for(int i=0; i<n; i++)
{
scanf("%d",&c);
root=shu(root);
}
flag=0;
PreOrder(root);
printf("\n");
}
return 0;
}