PAT 甲级 1064. Complete Binary Search Tree (30)
2017-10-02 00:08
399 查看
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:
Sample Output:
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:
10 1 2 3 4 5 6 7 8 9 0
Sample Output:
6 3 8 1 5 7 9 0 2 4
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> using namespace std; const int maxn = 1010; int n, number[maxn], cbt[maxn], index=0; void inOrder(int root) { if (root > n) return; inOrder(root * 2); cbt[root] = number[index++]; inOrder(root * 2 + 1); } int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &number[i]); } sort(number, number + n); inOrder(1); for (int i = 1; i <= n; i++) { printf("%d", cbt[i]); if (i < n) printf(" "); } return 0; }
相关文章推荐
- PAT甲级1064. Complete Binary Search Tree (30)
- PAT甲级 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) PAT甲级
- pat 甲级 1064. Complete Binary Search Tree (30)
- PAT甲级-1064. Complete Binary Search Tree (30)
- PAT (Advanced Level) 1064. Complete Binary Search Tree (30) 递归建立CBST
- 1064. Complete Binary Search Tree (30)【二叉树】——PAT (Advanced Level) Practise
- 【PAT】1064. Complete Binary Search Tree (30)
- PAT (Advanced Level) Practise 1064 Complete Binary Search Tree (30)
- pat-a1064. Complete Binary Search Tree (30)
- PAT 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)【二叉树】——PAT (Advanced Level) Practise
- PAT (Advanced Level) 1064. Complete Binary Search Tree (30)
- 【PAT】【Advanced Level】1064. Complete Binary Search Tree (30)
- PAT 1064. Complete Binary Search Tree (30)
- PAT-A 1064. Complete Binary Search Tree (30)