1、建立檔案ArrayTree.h 定義二叉樹的資料結構

#ifndef ARRAYTREE_H
#define ARRAYTREE_H
class ArrayTree{
public:
    ArrayTree(int size,int *pRoot);
    ~ArrayTree();
    int *searchNode(int nodeIndex);
    bool addNode(int nodeIndex,int direction,int *node);
    bool delNode(int nodeIndex,int *node);
    void treeTraverse();
private:
    int *m_pTree;
    int m_iSize;
};
#endif // ARRAYTREE_H
 

#include "ArrayTree.h"
#include <iostream>
using namespace std;
ArrayTree::ArrayTree(int size,int *pRoot){
    m_iSize = size;
    m_pTree = new int[m_iSize];
    for(int i = 0 ;i < m_iSize;i++)
        m_pTree[i] = 0;
    m_pTree[0] = *pRoot;
}
ArrayTree::~ArrayTree(){
    delete[] m_pTree;
    m_pTree = NULL;
}
int* ArrayTree::searchNode(int nodeIndex){
    if(nodeIndex < 0 || nodeIndex >= m_iSize)
        return NULL;
    if(m_pTree[nodeIndex] == 0)
        return NULL;
    return &m_pTree[nodeIndex];
}
/**
direction=1 表示將節點node新增到nodeIndex節點的左子樹
direction=2 表示將節點node新增到nodeIndex節點的右子樹
**/
bool ArrayTree::addNode(int nodeIndex,int direction,int *node){
    if(nodeIndex < 0 || nodeIndex >= m_iSize)
        return false;
    int index = nodeIndex*2 + direction;
    if(index >= m_iSize)
        return false;
    m_pTree[index] = *node;
    return true;
}
/**
刪除一個節點的時候要將他的子樹也刪除掉,但是此處並沒有考慮
**/
bool ArrayTree::delNode(int nodeIndex,int *node){
    if(nodeIndex < 0 || nodeIndex >= m_iSize)
        return false;
    if(m_pTree[nodeIndex] == 0)
        return false;
    *node = m_pTree[nodeIndex];
    m_pTree[nodeIndex] = 0;
    return true;
}
void ArrayTree::treeTraverse(){
    for(int i = 0;i < m_iSize;i++){
        cout<<m_pTree[i]<<",";
    }
    cout<<endl;
}
 

#include <iostream>
#include "ArrayTree.h"
using namespace std;
/**
二叉樹的定義（陣列表示）
bool createTree(Tree* pTree,Node *pRoot);   //建立樹
void destoryTree（Tree *pTree）;            //銷燬樹
Node* SearchNode（Tree *pTree,int nodeIndex）;//根據節點索引尋找二叉樹
bool addNode(Tree *pTree,int nodeInedx,int drirecton,Node *pNode);//新增節點
void deleteNode（Tree *pTree,int nodeIndex,Node *pNode）;//刪除節點
void treeTraverse（Tree *pTree）;           //遍歷
int tree[n] 3 5 8 2 6 9 7
                3[0]                //左孩子的下標=父節點的下標*2 + 1
                                    //右孩子的下標=父節點的下標*2 + 2
        5[1]            8[2]
     2[3]   6[4]     9[5]   7[6]

**/
/**節點的度就是節點的分支的個數**/
int main()
{
    int root = 3;
    ArrayTree *pTree = new ArrayTree(10,&root);
    int n1 = 5;
    int n2 = 8;
    pTree->addNode(0,1,&n1);
    pTree->addNode(0,2,&n2);

    int n3 = 2;
    int n4 = 6;
    pTree->addNode(1,1,&n3);
    pTree->addNode(1,2,&n4);

    int n5 = 9;
    int n6 = 7;
    pTree->addNode(2,1,&n5);
    pTree->addNode(2,2,&n6);

    pTree->treeTraverse();

    int temp;
    pTree->delNode(6,&temp);
    cout<<"temp:"<<temp<<endl;
    pTree->treeTraverse();
    int *node = pTree->searchNode(2);
    cout<<"node:"<<*node<<endl;
    delete pTree;
    return 0;
}