二叉树【数组实现】基础练习

/*************************/
/*二叉树（数组表示）

课程要求：完成数的基本操作
1.树的创建与销毁
2.树中结点的搜索
3.树中结点的添加与删除
4.树中结点的遍历
BOOL CreateTree(Tree**pTree,Node *pRoot);//创建树
void DestoryTree(Tree*pTree);//销毁树
Node *SearchNode(Tree*pTree,int nodeIndex);//根据索引寻找节点
BOOL AddNode(Tree*pTree,int nodeIndex,int direction，Node *pNode);//添加节点
BOOL DeleteNode(Tree*pTree,int nodeIndex,Node*pNode);//删除节点
void TreeTraverse(Tree*pTree);//遍历

关于数组与树之间的算法转换
int tree[n] 3 5 8 2 6 9 7
父亲节点下标*2+1 -> 左结点
父亲节点下标*2+2 -> 右节点
3（0）
5（1） 8（2）
2（3） 6（4） 9（5）7（6）

*/
/*************************************/

Tree.h

#include<iostream>

using namespace std;


class Tree
{
public:
    Tree(int size, int *pRoot);//创建树
    ~Tree();//销毁树
    int *SearchNode(int nodeIndex);//根据索引寻找节点
    bool AddNode(int nodeIndex, int direction, int *pNode);//添加节点
    bool DeleteNode(int nodeIndex, int *pNode);//删除节点
    void TreeTraverse();//遍历
private:
    int *m_pTree;
    int m_iSize;

};

Tree.cpp

#include"Tree.h"

Tree::Tree(int size, int *pRoot)
{
    m_iSize = size;
    m_pTree = new int[size];
    for (int i = 0; i < size; i++)
    {
        m_pTree[i] = 0;

    }
    m_pTree[0] = *pRoot;
}

Tree ::~Tree()
{
    delete[]m_pTree;
    m_pTree = NULL;

}

int *Tree::SearchNode(int nodeIndex)
{
    if (nodeIndex < 0 || nodeIndex >= m_iSize)
    {
        return NULL;
    }
    if (m_pTree[nodeIndex] == 0)
    {
        return NULL;
    }

    return &m_pTree[nodeIndex];
}

bool Tree::AddNode(int nodeIndex, int direction, int *pNode)
{
    if (nodeIndex < 0 || nodeIndex >= m_iSize)
    {
        return false;
    }
    if (m_pTree[nodeIndex] == 0)
    {
        return false;
    }
    if (direction == 0)
    {
        if (nodeIndex * 2 + 1 >= m_iSize)
        {
            return false;
        }
        if (m_pTree[nodeIndex * 2 + 1] != 0)
        {
            return false;
        }
        m_pTree[nodeIndex * 2 + 1] = *pNode;
    }
    if (direction == 1)
    {
        if (nodeIndex * 2 + 2 >= m_iSize)
        {
            return false;
        }
        if (m_pTree[nodeIndex * 2 + 2] != 0)
        {
            return false;
        }
        m_pTree[nodeIndex * 2 + 2] = *pNode;
    }

    return true;
}

bool Tree::DeleteNode(int nodeIndex, int *pNode)
{
    if (nodeIndex < 0 || nodeIndex >= m_iSize)
    {
        return false;
    }
    if (m_pTree[nodeIndex] == 0)
    {
        return false;
    }
    *pNode = m_pTree[nodeIndex];
    m_pTree[nodeIndex] = 0;
    return true;
}


void Tree::TreeTraverse()
{
    for (int i = 0; i < m_iSize; i++)
    {
        cout << m_pTree[i] << " ";
    }

}

demo.cpp

#include"Tree.h"
#include<windows.h>
int main(void)
{
    int root = 3;
    Tree *pTree = new Tree(10, &root);//因为添加函数是在根节点的基础上*2进行添加的，所以调用添加函数根节点没有插入进来
    int node1 = 5;
    int node2 = 8;
    pTree->AddNode(0, 0, &node1);
    pTree->AddNode(0, 1, &node2);
    int node3 = 2;
    int node4 = 6;
    int node5 = 9;
    int node6 = 7;
    pTree->AddNode(1, 0, &node3);
    pTree->AddNode(1, 1, &node4);
    pTree->AddNode(2, 0, &node5);
    pTree->AddNode(2, 1, &node6);
    int node;
    pTree->DeleteNode(6 ,& node);
    pTree->TreeTraverse();

    int *p=pTree->SearchNode(2);
    cout << endl << "node=" << *p << endl;


    delete pTree;
    pTree = NULL;

    system("pause");
    return 0;
}