Binary sequential storage structure
Related properties:
- 2 up to the i-th layer above the binary i-1 nodes
- K binary tree has a depth of up to 2 k -1 nodes
- Terminal nodes (0 degrees) is n, the number of nodes of degree 2 is m, then n = m + 1
- Binary tree of n nodes having a depth (int) (log 2 n) + 1'd
Traversing Binary Tree
Preorder traversal, in order traversal, postorder traversal
Code
Tree.h
#ifndef TREE_H_
#define TREE_H_
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(); //遍历
public:
int *m_pTree; //存储数据
int m_iSize; //数组长度
};
#endif // !TREE_H_
Tree.cpp
#include "Tree.h"
#include <iostream>
using namespace std;
Tree::Tree(int size,int *pRoot)
{
m_iSize = size;
m_pTree = new int[size];
for (int i = 0; i < m_iSize; 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)
{//direction0为左孩子,1为右孩子
if (nodeIndex < 0 || nodeIndex >= m_iSize) //索引不合法
{
return NULL;
}
if (m_pTree[nodeIndex] == 0) //节点不存在
{
return NULL;
}
//左孩子 父节点下标*2+1
//右孩子 父节点下标*2+2
if (direction == 0)
{
if (nodeIndex * 2 + 1 >= m_iSize) //索引不合法
{
return NULL;
}
if (m_pTree[nodeIndex * 2 + 1] != 0) //节点已存在
{
return NULL;
}
m_pTree[nodeIndex * 2 + 1] = *pNode;
}
if (direction == 1)
{
if (nodeIndex * 2 + 2 >= m_iSize) //索引不合法
{
return NULL;
}
if (m_pTree[nodeIndex * 2 + 2] != 0) //节点已存在
{
return NULL;
}
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 <iostream>
#include <stdlib.h>
#include "Tree.h"
using namespace std;
/*
二叉树(数组表示)
完成树的基本操作
1.树的创建和销毁
2.树中节点的搜索
3.树中节点的添加与删除
4.树中节点的遍历
bool CreateTree(Tree **pTree,Node *pRoot); //创建树
void DestroyTree(Tree *pTree); //销毁树
Node *searchNode(Tree *pTree,int nodeIndex); //根据索引寻找节点
bool AddNode(Tree *pTree,int nodeIndex,Node *pNode); //添加节点
bool DeleteNode(Tree *pTree,int nodeIndex,Node *pNode); //删除节点
void TreeTraverse(Tree *pTree); //遍历
例如 3 5 8 2 6 9 7
*/
int main(void) {
int root = 3;
Tree *pTree = new Tree(10,&root);
int node1 = 5;
int node2 = 8;
pTree->AddNode(0, 0, &node1);
pTree->AddNode(0, 1, &node2);
int node3 = 2;
int node4 = 6;
pTree->AddNode(1, 0, &node3);
pTree->AddNode(1, 1, &node4);
int node5 = 9;
int node6 = 7;
pTree->AddNode(2, 0, &node5);
pTree->AddNode(2, 1, &node6);
int node = 0;
pTree->DeleteNode(6, &node);
cout << "node = " << node << endl;
pTree->TreeTraverse();
int *p = pTree->searchNode(2);
cout << endl << "*p=" << *p << endl;
delete pTree;
system("pause");
return 0;
}