1064. Complete Binary Search Tree (30)
来源:互联网 发布:kmp算法中的next数组 编辑:程序博客网 时间:2024/06/05 11:40
1064. Complete Binary Search Tree (30)
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.
A Complete Binary Tree (CBT) is a tree that is completely filled, with the possible exception of the bottom level, which is filled from left to right.
Now given a sequence of distinct non-negative integer keys, a unique BST can be constructed if it is required that the tree must also be a CBT. You are supposed to output the level order traversal sequence of this BST.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (<=1000). Then N distinct non-negative integer keys are given in the next line. All the numbers in a line are separated by a space and are no greater than 2000.
Output Specification:
For each test case, print in one line the level order traversal sequence of the corresponding complete binary search tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.
Sample Input:101 2 3 4 5 6 7 8 9 0Sample Output:
6 3 8 1 5 7 9 0 2 4
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define maxn 1100int in[maxn];int tree[maxn];int n;int cnt = 0;void creat(int index){ if(index > n) return; creat(index*2); tree[index] = in[cnt++]; creat(index*2+1);}int main(){ cin>>n; for(int i = 0; i < n; i++) { cin>>in[i]; } sort(in, in+n); creat(1); cout<<tree[1]; for(int i = 2; i <= n; i++) cout<<" "<<tree[i];}
- 1064. Complete Binary Search Tree (30)-PAT
- 1064. Complete Binary Search Tree (30)
- 【PAT】1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- PAT 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 1064. Complete Binary Search Tree (30)
- 005-SDK框架之LYWSDKCallBackListener.h
- Mac的Apache和Ftp的配置
- 文章标题
- CCF——炉石传说
- 深度优先遍历找出一个无向图中的环
- 1064. Complete Binary Search Tree (30)
- oracle12c之 表空间维护总结
- linux学习笔记(2)
- vue项目中使用sass
- centos7安装tomcat
- PHP 静态变量处理
- 单例模式(经典)
- Calico 的网络结构是什么?- 每天5分钟玩转 Docker 容器技术(68)
- shell在指定目录下批量执行sql脚本