1064 Complete Binary Search Tree （30 分）C语言——树的inorder();

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 0

Sample Output:

6 3 8 1 5 7 9 0 2 4

分析

recursively  递归地

一棵排序二叉树的中序遍历就是这一组数的递增序列。

这边是完全二叉树，假设从0开始，那么节点i的左孩子的标号就是2*i+1，右孩子的标号就是2*(i+1)。

先将这组数按照递增来排序，然后用中序遍历复原这棵完全排序二叉树，最后直接输出。

红色来自ryo_218的1064

代码

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define MAX 1005
int N,n[MAX],ins[MAX],k=0;
int cmp(const int *a,const int *b){
    return *a-*b;
}
void inorder(int);
int main(){
    int i;
    scanf("%d",&N);
    for(i=0;i<N;i++) scanf("%d",&n[i]);
    qsort(n,N,sizeof(int),cmp);
    inorder(0);
    //output
    printf("%d",ins[0]);
    for(i=1;i<N;i++) printf(" %d",ins[i]);
}
void inorder(int root){
    if(root>=N) return;
    inorder(2*root+1);//left child is 2*i+1
    ins[root]=n[k++];
    inorder(2*root+2);//right child is 2*(i+1)
}