Tree.h
#pragma once
#include <iostream>
//二叉树和 数组的算法转换
using namespace std;
class Tree
{
public:
Tree(void);
~Tree(void);
Tree(int size, int* pRoot);//创建树
int* SearNode(int nodeIndex);//根据索引寻找节点
//给指定的nodeIndex节点,添加左孩子pNode或者右孩子pNode
//direction是0 则是左孩子,1是右孩子
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 "StdAfx.h"
#include "Tree.h"
Tree::Tree(void)
{
}
Tree::Tree( int size, int* pRoot)
{
m_pTree = new int[size];
memset(m_pTree,0,size*sizeof(int));
m_iSize = size;
m_pTree[0] = *pRoot;
}
Tree::~Tree(void)
{
delete[] m_pTree;
m_pTree = NULL;
}
int* Tree::SearNode( 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)
{
int newpos = nodeIndex * 2 + 1;
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)
{
int newpos = nodeIndex * 2 + 2;
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 false;
}
void Tree::TreeTraverse()
{
for (int i = 0; i < m_iSize; i++)
{
cout << m_pTree[i] << " ";
}
}