二叉树的实现

最新推荐文章于 2022-07-04 20:36:06 发布

weixin_40137708

最新推荐文章于 2022-07-04 20:36:06 发布

阅读量192

点赞数

分类专栏：二叉树文章标签：二叉树

本文链接：https://blog.csdn.net/weixin_40137708/article/details/78418323

版权

二叉树专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;

class tree
{public:
tree(int size,int *proot);//构造函数
~tree();
bool addnode(int nodeindex,int direction,int *pnode);//插入结点
int *searchnode(int nodeindex);//找到树结点
bool deletenode(int nodeindex,int *pnode);//删除结点
void tree::treetraverse();//遍历整棵树
private:
int m_isize;
int *m_ptree;

};

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]<<" ";}
}

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(1,0,&node5);
ptree->addnode(1,1,&node6);
cout<<"该树存储的数据为："<<endl;
ptree->treetraverse();
cout<<endl;
//删除结点
int node=0;
ptree->deletenode(4,&node);
cout<<"删除的结点为："<<node<<endl;
ptree->treetraverse();
int *p=ptree->searchnode(3);
cout<<endl<<"查找node3的值为："<<*p<<endl;
delete ptree;
system("pause");
}