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:10 1 2 3 4 5 6 7 8 9 0Sample Output:
6 3 8 1 5 7 9 0 2 4
DFS建树,BFS输出,根据完全二叉树的特点,也不用记录左右子树的下标,有left=2*root+1,right=2*root+2(root从0计)。
#include <iostream> #include <algorithm> #include <queue> using namespace std; int n; int num[1000]; int p[1000]; int cnt; void dfs(int root) { if(2*root+1<n) dfs(2*root+1); p[root]=num[cnt]; cnt++; if(2*root+2<n) dfs(2*root+2); } void bfs() { queue<int>q; q.push(0); bool f=true; while(!q.empty()) { int t=q.front(); if(f) f=false; else cout<<" "; cout<<p[t]; q.pop(); if(2*t+1<n) q.push(2*t+1); if(2*t+2<n) q.push(2*t+2); } } int main() { cin>>n; for(int i=0;i<n;++i) cin>>num[i]; sort(num,num+n); dfs(0); bfs(); return 0; }