PAT | A1064 Complete Binary Search Tree

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>

using namespace std;

//最多1000个节点 -> 最多10层
// log2(n) = log(n) / log(2)

int seq[1010];
vector<int> lay[11];//lay[i]存放第i层的层序遍历序列

void findRoot(int layer,int l,int r){
	if(l == r){
		lay[layer].push_back(seq[l]);
		return;
	}
	if(l > r)
		return;
	int n = r - l + 1;
	int fullLayer = log(n) / log(2); // 有多少层满
	if(pow(2,fullLayer + 1) - 1 == n){//是满二叉树
		lay[layer].push_back(seq[l + (n - 1) / 2]);
		findRoot(layer + 1,l,l + (n - 1) / 2 - 1);
		findRoot(layer + 1,l + (n - 1) / 2 + 1,r);
	}else{//不是满二叉树
		int lastLayer = n - pow(2,fullLayer) + 1;
		if(lastLayer >= pow(2,fullLayer - 1)){//左子树满
			int le = pow(2,fullLayer) - 1;//左子树有这么多节点
			lay[layer].push_back(seq[l + le]);
			findRoot(layer + 1,l,l + le - 1);
			findRoot(layer + 1,l + le + 1,r);
		}else{ //左子树不满
			int le = pow(2,fullLayer - 1) - 1 + lastLayer;
			lay[layer].push_back(seq[l + le]);
			findRoot(layer + 1,l,l + le - 1);
			findRoot(layer + 1,l + le + 1,r);
		}
	}
	return;
}

int main(){
	int n;
	scanf("%d",&n);
	for(int i = 0;i < n;i++){
		scanf("%d",&seq[i]);
	}
	sort(seq,seq + n);
	findRoot(1,0,n - 1);
	for(int i = 1;i < 11;i++){
		if(lay[i].size() == 0){
			break;
		}
		for(int j = 0;j < lay[i].size();j++){
			if(j == lay[i].size() - 1 && lay[i + 1].size() == 0){
				printf("%d",lay[i][j]);
			}else
				printf("%d ",lay[i][j]);
		}
	}
	system("pause");
	return 0;
}