二叉树的基本操作如下:
Btreenode* InitCompleteBinaryTree(T *a,int len);//按数组a的顺序初始化一个完全二叉树(反序列化过程)
Btreenode* ClearBtree(Btreenode* root);//清空树
bool IsEmpty(Btreenode*root);//是否是空树
void TreeDeep(Btreenode*root,int step,int &deep);//树的高度
void DestroyTree(Btreenode*root);//销毁树
void MirrorTree(Btreenode*root);//树的镜像
void SequenceTraversalTree(Btreenode*root,vector<T>&a);//层序遍历
void BeforTraversalTree(Btreenode*root,vector<T>&a);//前序遍历
void BeforTraversalTree(Btreenode*root,vector<Btreenode*>&a);//前序遍历存结点
void MiddleTraversalTree(Btreenode*root,vector<T>&a);//中序遍历
void LastTraversalTree(Btreenode*root,vector<T>&a);//后序遍历
具体代码如下:
#ifndef data_structure_tree_h
#define data_structure_tree_h
#include <iostream>
#include <vector>
#include<functional>
using namespace std;
template<typename T>
class Btreenode//二叉树
{
public:
Btreenode(){};
Btreenode(T a):val(a),leftchild(NULL),rightchild(NULL){};
~Btreenode(){};
Btreenode* InitCompleteBinaryTree(T *a,int len);//按数组a的顺序初始化一个完全二叉树(反序列化过程)
Btreenode* ClearBtree(Btreenode* root);//清空树
bool IsEmpty(Btreenode*root);//是否是空树
void TreeDeep(Btreenode*root,int step,int &deep);//树的高度
void DestroyTree(Btreenode*root);//销毁树
void MirrorTree(Btreenode*root);//树的镜像
void SequenceTraversalTree(Btreenode*root,vector<T>&a);//层序遍历
void BeforTraversalTree(Btreenode*root,vector<T>&a);//前序遍历
void BeforTraversalTree(Btreenode*root,vector<Btreenode*>&a);//前序遍历存结点
void MiddleTraversalTree(Btreenode*root,vector<T>&a);//中序遍历
void LastTraversalTree(Btreenode*root,vector<T>&a);//后序遍历
private:
T val;
Btreenode * leftchild,* rightchild ;
};
template<typename T>
Btreenode<T>* Btreenode<T>::InitCompleteBinaryTree(T *a,int len)
{
vector<Btreenode* >v1;
for (int i=0;i<len;i++)
{
Btreenode* root=new Btreenode(a[i]);
v1.push_back(root);
}
for(int i=0;i<len;i++)
{
if(2*i+2<len) v1[i]->rightchild=v1[2*i+2];
if(2*i+1<len) v1[i]->leftchild=v1[2*i+1];
}
return v1[0];
}
template<typename T>
void Btreenode<T>::BeforTraversalTree(Btreenode*root,vector<T>&a)
{
if(!root) return;
a.push_back(root->val);
Btreenode<T>::BeforTraversalTree(root->leftchild,a);
Btreenode<T>::BeforTraversalTree(root->rightchild,a);
};
template<typename T>
void Btreenode<T>::BeforTraversalTree(Btreenode*root,vector<Btreenode*>&a)
{
if(!root) return;
a.push_back(root);
Btreenode<T>::BeforTraversalTree(root->leftchild,a);
Btreenode<T>::BeforTraversalTree(root->rightchild,a);
}
template<typename T>
void Btreenode<T>::MiddleTraversalTree(Btreenode*root,vector<T>&a)
{
if(!root) return;
Btreenode<T>::BeforTraversalTree(root->leftchild,a);
a.push_back(root->val);
Btreenode<T>::BeforTraversalTree(root->rightchild,a);
}
template<typename T>
void Btreenode<T>::LastTraversalTree(Btreenode*root,vector<T>&a)
{
if(!root) return;
Btreenode<T>::BeforTraversalTree(root->leftchild,a);
Btreenode<T>::BeforTraversalTree(root->rightchild,a);
a.push_back(root->val);
}
template<typename T>
Btreenode<T>* Btreenode<T>::ClearBtree(Btreenode* root)
{
vector<Btreenode*>v1;
Btreenode<T>::BeforTraversalTree(root,v1);
for (int i=1;i<v1.size();i++) delete v1[i];
v1[0]->leftchild=NULL;
v1[0]->rightchild=NULL;
v1[0]=NULL;
return v1[0];
}
template<typename T>
bool Btreenode<T>::IsEmpty(Btreenode*root)
{
if (root) return false;
return true;
}
template<typename T>
void Btreenode<T>::TreeDeep(Btreenode*root,int step,int &deep)
{
static int max_deep=0;
if(!root)
{
deep=max_deep;
return ;
}
step++;
if(step>max_deep) max_deep=step;
Btreenode<T>::TreeDeep(root->leftchild,step,deep);
Btreenode<T>::TreeDeep(root->rightchild,step,deep);
}
template<typename T>
void Btreenode<T>::DestroyTree(Btreenode*root)
{
vector<Btreenode*>v1;
Btreenode<T>::BeforTraversalTree(root,v1);
for (int i=0;i<v1.size();i++) delete v1[i];
}
template<typename T>
void Btreenode<T>::MirrorTree(Btreenode*root)
{
if (root==NULL)
return;
if(root->leftchild==NULL&&root->rightchild==NULL)
return;
else if(root->leftchild==NULL)
{
root->leftchild=root->rightchild;
root->rightchild=NULL;
}
else if(root->rightchild==NULL)
{
root->rightchild=root->leftchild;
root->leftchild=NULL;
}
else
{
Btreenode* temp= root->leftchild;
root->leftchild= root->rightchild;
root->rightchild=temp;
}
MirrorTree(root->leftchild);
MirrorTree(root->rightchild);
}
template<typename T>
void Btreenode<T>::SequenceTraversalTree(Btreenode*root,vector<T>&a)
{
vector<Btreenode*>v1;
v1.push_back(root);
int i=0;
while(i<v1.size())
{
if(v1[i]->leftchild) v1.push_back(v1[i]->leftchild);
if(v1[i]->rightchild) v1.push_back(v1[i]->rightchild);
i++;
}
for (i=0;i<v1.size();i++) a.push_back(v1[i]->val);
}
#endif
测试代码如下:
#include "data_structure_tree.h"
int main()
{
Btreenode<int>* root=NULL;
int a[]={1,2,3,4,5,6,7,8};
root=root->InitCompleteBinaryTree(a,7);
vector<int> b;
root->SequenceTraversalTree(root,b);
return 0;
}
初学数据结构,不足之处还请大神指点,不胜感激。。。。