用数组建立二叉树源码

//用数组建立二叉树
#include <iostream>
using namespace std;

const int maxsize = 9;
const int treesize= 16;

int main()
{
int data[maxsize] = {0, 6, 3, 5, 9, 7, 8, 4, 2};
int btree[treesize] = {0};
cout << "原始数据输出：" << endl;
int k(0);
for (int i(1); i != maxsize; ++i)
{
cout << "[" << data[i] << "]\t";
if (++k%5 == 0)
{
cout << endl;
}
}
cout << endl;
int level;
for (int i(1); i != maxsize; ++i)
{
for (level = 1; btree[level] != 0;)
{
if (data[i] > btree[level])
{
level = 2*level + 1;