C++ 数组实现二叉树

用数组实现二叉树 ，关键是用父节点的*2+1表示左儿子，父节点的*2+2表示右节点

 

Tree.h

#pragma once
class Tree
{
private:
	int *m_pTree;
	int m_iSize;

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();                                          // 二叉树的遍历
};

Tree.cpp

#include<iostream>

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++)
	{
		std::cout << m_pTree[i] << " ";
	}
}

测试函数

#include "Tree.h"
#include<iostream>
         
using namespace std;
/*
           3(0)
	5(1)          8(2)

2(3)    6(4)  9(5)     7(6)   
      

*/

int main()
{
	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;
	cout << "node=" << *p << endl;

	delete pTree;
    return 0;
}