treenodebst.h.~2~

来自「我们高校的数据结构与算法的教师讲义,适合想自学数据结构的朋友参考.」· ~2~ 代码 · 共 29 行

#ifndef TREENODEBST_H
#define TREENODEBST_H
// *********************************************************
// Header file TreeNodeBST.h for the ADT binary search tree.
// This is the TreeNode class defined on page page 541 
// of text.
// *********************************************************
#include "KeyedItem.h"
#define NULL 0L
typedef KeyedItem TreeItemType;


class TreeNode // a node in the tree
{
private:
   TreeNode() { }
   TreeNode(const TreeItemType& nodeItem,
            TreeNode *left = NULL, TreeNode *right = NULL)
           : item(nodeItem), leftChildPtr(left),
             rightChildPtr(right) { }
   TreeItemType item; // a data item in the tree
   // pointers to children
   TreeNode *leftChildPtr, *rightChildPtr;

   // friend class - can access private parts
   friend class BinarySearchTree;
}; // end class

#endif