The order of a Tree

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 64 Accepted Submission(s) : 34

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

41 3 4 2

Sample Output

1 3 2 4

#include <iostream>
#include <stdio.h>
#include <string.h>using namespace std;#define N 100005
int tree[N],l[N],r[N],a[N],num,flag,m;void fx(int k,int x)
{if( x <= tree[k] ){if(l[k] == -1) l[k] = flag;else fx(l[k],x);}else{if(r[k] == -1) r[k] = flag;else fx(r[k],x);}
}void f(int k)
{a[m++] = tree[k];if(l[k] != -1)f(l[k]);if(r[k] != -1)f(r[k]);
}
int main()
{int n,i,x,root;while(~scanf("%d",&n)){memset(l,-1,sizeof(l));memset(r,-1,sizeof(r));root = -1;flag = 0;for(i = 0; i< n; i++){scanf("%d",&x);if(root == -1)tree[++root] = x;else{tree[++flag] = x;fx(root,x);}}m = 0;f(root);for(i = 0; i < m -1; i++)printf("%d ",a[i]);printf("%d\n",a[m-1]);}return 0;
}

HDU3999-The order of a Tree相关推荐

HDU3999 The order of a Tree【二叉搜索树 + 前序遍历】
The order of a Tree 题意: 给定一个二叉搜索树的插入顺序,要求输出建树之后的前序遍历. 题解: 连续第二天做到二叉搜索树了,真的吹爆这个算法,从二叉树啥也不懂,到简单搜索树直接秒杀 ...
hdu3999 The order of a Tree（BST的建立）
http://acm.hdu.edu.cn/showproblem.php?pid=3999 题意:给你一个序列可以构成一个二叉搜索树,求此二叉搜索树字典序最小的输入序列. 思路:这题只要明确一点就可 ...
The order of a Tree hdu3999 二叉搜索树
题目链接: hdu3999 The order of a Tree 题意: 给一个二叉搜索树的序列,求输出可以构成这个二叉搜索树的且满足字典序最小的插入序列找了一个比较具体描述怎么根据序列建立二叉搜 ...
The order of a Tree（模拟BST的建树和访问）
题目链接 Problem Description As we know,the shape of a binary search tree is greatly related to the orde ...
leetcode【102，103】Binary Tree Level Order Traversal Binary Tree Zigzag Level Order Traversal
问题描述(102): Given a binary tree, return the level order traversal of its nodes' values. (ie, from lef ...
hdu 3999The order of a Tree
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=3999 本题为简单二叉排序树,先按排序树创建树,然后先序遍历二叉树,输出的时候最后一个数字后面没有空格. ...
HDU 3999 The order of a Tree
/*二叉树的插入,前序遍历. */#include<iostream> #include<cstring> #include<stdio.h> #include&l ...
01 二叉树的BFS（广度、层次或水平遍历实现）【Binary Tree 二叉树】
二叉树的遍历分为BFS和DFS两种大类下面完整实现BFS遍历二叉树 * 例如二叉树* 1* / \* 2 3* /\* 4 5 BFS遍历结果:1-2-3-4-5 具体的代码实现: 方法一.采用递归 ...
Linux进程浏览器htop安装与使用
htop 是一个 Linux 下的交互式的进程浏览器,可以用来替换Linux下的top命令.当前具有按树状方式来查看进程,支持颜色主题,可以定制等特性.其实htop是top的加强版,增加了很多功能. ...

HDU3999-The order of a Tree