C++二叉树的实现完整程序源码

[精] C++二叉树的实现 
2007-11-30 15:07:17 本文已公布到博客频道校园・教育分类 
#include<iostream.h>
#include<stdlib.h>
template<class T>
struct BTNode
{
 T data;
 BTNode<T> *lChild,*rChild;
 BTNode();
 BTNode(const T &val,BTNode<T> *Childl=NULL,BTNode<T> *Childr=NULL)
 {
  data=val;
  lChild=Childl;
  rChild=Childr;
 }
 BTNode<T>* CopyTree()
 {
  BTNode<T> *nl,*nr,*nn;
  if(&data==NULL)
   return NULL;
  nl=lChild->CopyTree();
  nr=rChild->CopyTree();
  nn=new BTNode<T>(data,nl,nr);
  return nn;
 }
};
template<class T>
BTNode<T>::BTNode()
{

 lChild=rChild=NULL;
}
template<class T>
class BinaryTree
{
 public:
  BTNode<T> *root;
  BinaryTree();
  ~BinaryTree();
  void Pre_Order();
  void In_Order();
  void Post_Order();
  int TreeHeight()const;
  int TreeNodeCount()const;
  void DestroyTree();
  BTNode<T>* MakeTree(const T &element,BTNode<T> *l,BTNode<T> *r)
  {
   root=new BTNode<T>(element,l,r);
   if(root==NULL)
   {
    cout<<"申请存贮地址失败，系统将关闭进程/n";
    exit(1);
   }
   return root;
  }
 private:
  void Destroy(BTNode<T> *&r);
  void PreOrder(BTNode<T> *r);
  void InOrder(BTNode<T> *r);
  void PostOrder(BTNode<T> *r);