btnode2.h

霍夫曼的文件编码源代码

#ifndef BinaryTreeNode_
#define BinaryTreeNode_

template <class T> class BinaryTree;

template <class T>
class BinaryTreeNode {
   friend BinaryTree<T>;
   friend void PlaceBoosters(BinaryTreeNode<T> *);
   friend BinaryTree<int> HuffmanTree(T a[], int n);
   friend void Code(BinaryTree<int> c, int ch[]);
   public:
      BinaryTreeNode() {LeftChild = RightChild = 0;}
      BinaryTreeNode(const T& e)
            {data = e; LeftChild = RightChild = 0;}
      BinaryTreeNode(const T& e, BinaryTreeNode *l,
                     BinaryTreeNode *r)
       {data = e; LeftChild = l; RightChild = r;}
   private:
      T data;
      BinaryTreeNode<T> *LeftChild,  //左子树
                        *RightChild; //右子树
};

#endif