btnode1.h

来自「数据结构c++语言描述 Borland C++实现」· C头文件 代码 · 共 40 行

#ifndef BinaryTreeNode_
#define BinaryTreeNode_

template <class T> class BinaryTree;

template <class T>
class BinaryTreeNode {
   friend void Visit(BinaryTreeNode<T> *);
   friend void InOrder(BinaryTreeNode<T> *);
   friend void PreOrder(BinaryTreeNode<T> *);
   friend void PostOrder(BinaryTreeNode<T> *);
   friend void LevelOrder(BinaryTreeNode<T> *);
   friend void Erase(BinaryTreeNode<T> * &);
   friend BinaryTreeNode<int>* BuildFromPreAndIn
          (int InMap[], int StartIn, int EndIn,
           int PreList[], int &StartPre);
   friend BinaryTreeNode<int>* BuildFromPostAndIn
          (int InMap[], int StartIn, int EndIn,
           int PostList[], int &StartPost);
   friend BinaryTreeNode<T>* PostCopy(BinaryTreeNode<T>*);
   friend BinaryTreeNode<T>* PreCopy(BinaryTreeNode<T>*);
   friend void main(void);
   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,   // left subtree
                        *RightChild;  // right subtree
};

#endif