二叉链表的自我练习

//Bitree.h

#ifndef BITREE_H
#define BITREE_H
#include <iostream>
using namespace std;
template <class T>
struct BiNode
{
	T data;
	BiNode<T> *lchild,*rchild;
};
template <class T>
class BiTree
{
public:
	BiTree(){root=Creat(root);}
	~BiTree(){Release(root);}
	void PreOrder(){PreOrder(root);}
	void InOrder(){InOrder(root);}
	void PostOrder(){PostOrder(root);}
	void LeverOrder();
	BiNode<T>*Getroot(){return root;}
private:
	BiNode<T> *root;
	BiNode<T> *Creat(BiNode<T> *bt);
	void Release(BiNode<T> *bt);
	void PreOrder(BiNode<T> *bt);
	void InOrder(BiNode<T> *bt);
	void PostOrder(BiNode<T> *bt);
};
template <class T>
BiNode<T> *BiTree<T>::Creat(BiNode<T> *bt)
{
	char ch;
	cin>>ch;
	if(ch=='#') bt=NULL;
	else
	{
		bt=new BiNode<T>;
		bt->data=ch;
		bt->lchild=Creat(bt->lchild);
		bt->rchild=Creat(bt->rchild);
	}
	return bt;
}
template <class T>
void BiTree<T>::Release(BiNode<T> *bt)
{
	if(bt!=NULL)
	{
		Release(bt->lchild);
		Release(bt->rchild);
		delete bt;
	}
}
template <class T>
void BiTree<T>::PreOrder(BiNode<T> *bt)
{
	if(bt==NULL) return;
	else
	{
		cout<<bt->data;
		PreOrder(bt->lchild);
		PreOrder(bt->rchild);
	}
}

template <class T>
void BiTree<T>::InOrder(BiNode<T> *bt)
{
	if(bt==NULL)return;
	else
	{
		InOrder(bt->lchild);
		cout<<bt->data;
		InOrder(bt->rchild);
	}
}
template <class T>
void BiTree<T>::PostOrder(BiNode<T> *bt)
{
	if(bt==NULL) return;
	else
	{
		PostOrder(bt->lchild);
		PostOrder(bt->rchild);
		cout<<bt->data;
	}
}
template <class T>
void BiTree<T>::LeverOrder()
{
	int front,rear;
	BiNode<T>* Q[50];
	front=rear=-1;
	if(root==NULL)return;
	rear=(rear+1)%50;
	Q[rear]=root;
	while(front!=rear)
	{
		front=(front+1)%50;
		BiNode<T>*q=Q[front];
		cout<<q->data;
		if(q->lchild!=NULL) {rear=(rear+1)%50;Q[rear]=q->lchild;}
		if(q->rchild!=NULL) {rear=(rear+1)%50;Q[rear]=q->rchild;}
	}
}



#endif

//bitree.cpp

#include "Bitree.h"

int main()
{
	cout<<"请输入创建一棵二叉树的结点数据：(按照扩展二叉树的前序遍历序列)"<<endl;
	BiTree<char> b;
    cout<<"------前序遍历------ "<<endl; 
	b.PreOrder();
	cout<<endl;
	cout<<"------中序遍历------ "<<endl; 
	b.InOrder();
	cout<<endl;
	cout<<"------后序遍历------ "<<endl; 
	b.PostOrder();
	cout<<endl;
	cout<<"------层序遍历------ "<<endl; 
	b.LeverOrder();
	cout<<endl;
	return 0;
}

程序结果：

请输入创建一棵二叉树的结点数据：(按照扩展二叉树的前序遍历序列)

ABD#G###CE##F##

------前序遍历------

ABDGCEF

------中序遍历------

DGBAECF
------后序遍历------

GDBEFCA
------层序遍历------ 

ABCDEFG

备注：该例子采用的是书113页中的例子。