1099. Build A Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
来源:互联网 发布:数据库商品价格大于0 编辑:程序博客网 时间:2024/04/29 11:39
题目信息
1099. Build A Binary Search Tree (30)
时间限制100 ms
内存限制65536 kB
代码长度限制16000 B
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
Given the structure of a binary tree and a sequence of distinct integer keys, there is only one way to fill these keys into the tree so that the resulting tree satisfies the definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=100) which is the total number of nodes in the tree. The next N lines each contains the left and the right children of a node in the format “left_index right_index”, provided that the nodes are numbered from 0 to N-1, and 0 is always the root. If one child is missing, then -1 will represent the NULL child pointer. Finally N distinct integer keys are given in the last line.
Output Specification:
For each test case, print in one line the level order traversal sequence of that tree. All the numbers must be separated by a space, with no extra space at the end of the line.
Sample Input:
9
1 6
2 3
-1 -1
-1 4
5 -1
-1 -1
7 -1
-1 8
-1 -1
73 45 11 58 82 25 67 38 42
Sample Output:
58 25 82 11 38 67 45 73 42
解题思路
AC代码
- 1099. Build A Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
- 1043. Is It a Binary Search Tree (25)【二叉树】——PAT (Advanced Level) Practise
- 1064. Complete Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
- 【PAT】【Advanced Level】1099. Build A Binary Search Tree (30)
- PAT (Advanced Level) Practise 1099 Build A Binary Search Tree (30)
- PAT (Advanced Level) Practise 1099 Build A Binary Search Tree (30)
- 1102. Invert a Binary Tree (25)【二叉树】——PAT (Advanced Level) Practise
- PAT (Advanced Level) 1099 Build A Binary Search Tree (30)
- PAT (Advanced Level) Practise 1064 Complete Binary Search Tree (30)
- PAT (Advanced Level) Practise 1064 Complete Binary Search Tree (30)
- PAT (Advanced Level) 1099. Build A Binary Search Tree (30) 中序遍历往BST中填数据
- 浙大PAT (Advanced Level) Practise 1043Is It a Binary Search Tree (25)
- PAT (Advanced Level) Practise 1043 Is It a Binary Search Tree (25)
- PAT (Advanced Level) Practise 1043 Is It a Binary Search Tree (25)
- PAT (Advanced Level) Practise 1102 Invert a Binary Tree (25)
- PAT (Advanced Level) Practise 1102 Invert a Binary Tree (25)
- PAT (Advanced Level) Practise 1102. Invert a Binary Tree (25) 二叉树的层序和中序遍历
- Pat(Advanced Level)Practice--1099(Build A Binary Search Tree )
- 电子商务平台
- JAVA中Long与Integer比较容易犯的错误
- Unity3D之Mecanim动画系统
- php+nginx搭建
- 日期转化为时间戳
- 1099. Build A Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
- zendstudio10.0调试方法
- 多文件及多目录下MakeFile文件的编写
- 1019
- OC中为什么要使用alloc/init而很少使用new
- Sql 注入问题总结
- BZOJ 1003: [ZJOI2006]物流运输(spfa+dp)
- [Contiki系列论文之4]ContikiMAC RDC协议
- 优化——导出大量数据