The order of a Tree HDU

                                                 The order of  a Tree

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 834    Accepted Submission(s): 452

Problem Description

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 <stdlib.h>

bool first;
typedef struct BITree
{
    int data;
    BITree *Left,*Right;
}BiTree,*Tree;

BiTree *Insert(Tree root,int num)
{
    if(root == NULL){
        root = (Tree)malloc(sizeof(BITree));
        root->data = num;
        root->Left = NULL;
        root->Right = NULL;

    }else
    {
        if(num < root->data)
          root->Left = Insert(root->Left,num);
        else
          root->Right = Insert(root->Right,num);
    }
    return root;
}

void Print(Tree root)
{
    if(first)
      printf("%d",root->data);
    else
      printf(" %d",root->data);
    first = false;
    if(root->Left != NULL)
      Print(root->Left);
    if(root->Right != NULL)
      Print(root->Right);
}
int main()
{
    int n,i,t;
    Tree root;
    while(~scanf("%d",&n))
    {
        root = NULL;
        for(i = 1;i <= n;i++)
        {
            scanf("%d",&t);
            root = Insert(root,t);
        }
        first = true;
        Print(root);
        printf("\n");
    }
    return 0;
}