04-树6 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$ ($\le 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

  
  这个题想了好久，最后还是看别人的代码才明白了，就是根据完全二叉树的性质，完全二叉树在数组中某个节点的下标为i，则其左右孩子的下标分别为2*1,2*i+1。

然后递归建树。记录一下以后忘了再来看看



  import java.util.Scanner;
  import java.util.Arrays;
  public class Main{
  	private static int[] nodes = new int[1005];
  	private static int[] trees = new int[1005];
  	private static int N;
  	private static int pos;
  	public static void main(String[] args) {
  			Scanner scan = new Scanner(System.in);
  			N = scan.nextInt();
  			for(int i=0;i<N;i++){
  				nodes[i] = scan.nextInt();
  			}
  			Arrays.sort(nodes,0,N);
  			pos = 0;
  			int root = 1;
  			build(root);
  			String str = "";
  			for(int i=1;i<=N;i++){
  				str+=trees[i]+" ";
  			}
  			System.out.println(str.trim());
  	}
  
  	public static void build(int root){
  		if(root>N){
  			return;
  		}
  		int lson = root<<1;
  		int rson = (root<<1)+1;
  		build(lson);
  		trees[root] = nodes[pos++];
  		build(rson);
  	}
  }