C++ Tree

二叉树

//========================================//
//程序名称：建立二叉树                    //
//Written By HEWEI                        //
//2011 05 30                              //
//========================================//

//=============================================//
//二叉树规则：                                 //
//       1.输入各元素值存入nodelist数组        //
//       2.二叉树各元素存入b_tree数组          //
//       3.节点遵循左小(level*2)右大(level*2+1)//
//=============================================//
#include<iostream>
using namespace std;

#define  MAX 20
//声明nodelist 和 b_tree数组
int NodeList[MAX];
int b_tree[MAX];
int index = 0;

//----------------------------------------------//
//-------------建立二叉树-----------------------//
//----------------------------------------------//
void Create_Tree()
{
 int level;
 int i;
 //存入第一个元素与b_tree[1]
 b_tree[1] = NodeList[1];
 //取出NodeList中的值，按照二叉树的规则存入b_tree
for(i = 2 ; i <= index; i++)
{
level = 1;                         //从第1层开始搜寻
while(b_tree[level] != 0)          //判断是否有子树存在
{
    if(NodeList[i] < b_tree[level])//判断是左子树还是右子树
        level = level * 2;         //左子树
    else
        level = level * 2 + 1;     //右子树
}
b_tree[level] = NodeList[i];
}
}

//----------------------------------------------//
//--------------各元素值存入nodelist数组--------//
//----------------------------------------------//
void Store_Data(int nCapacity)
{
    int temp;
    for(int i = 1; i <= nCapacity; i++)
    {
        cout <<"Please Input Data :";
        cin >> temp;
        NodeList[i] = temp;
        index ++;
    }
    cout << endl;
}


//--------------------------------------------//
//---------------输出数组元素-----------------//
//--------------------------------------------//
void Output(int *pointer,int Max_index)
{
   for(int i = 1; i < Max_index; i++)
       cout << pointer[i] << " ";
}

int main(void)
{
    int capacity ; //输入数据的容量
    //初始化数组为0
    for(int i = 0; i < MAX; i++)
    {
        NodeList[i] = 0;
        b_tree[i] = 0;
    }

    //存储输入的数据
    cout <<"Please Input the capacity : ";
    cin >> capacity;
    cout << endl;
    Store_Data(capacity);
    //建立二叉树
    Create_Tree();

    //输出数组和二叉树的元素
    cout <<"Output the content Data of NodeList : " << endl;
    Output(NodeList,MAX);
    cout << endl;
    cout <<"Output the content Data of b_tree : " << endl;
    //Output(b_tree,MAX);
    for(int i = 1; i < MAX; i ++)
    {
        cout <<"[" << i << "]" << "    " << b_tree[i] << endl;
    }
    return 0;
}