bintreenode.h

我用二叉搜索树做的学生成绩管理系统

#ifndef BIN_TREE_NODE_CLASS
#define BIN_TREE_NODE_CLASS

#include <assert.h>
#include <iostream.h>
#include <iomanip.h>
#include <stdlib.h>

#ifndef NULL
const int NULL=0;
#endif

template <class T>
class BinaryTree;

template <class T>
class BinTreeNode
{
	friend class BinaryTree<T>;
	protected:
		BinTreeNode<T> *left;
		BinTreeNode<T> *right;
		T data;
	public:
		BinTreeNode(const T & item,
			BinTreeNode<T> *lptr=NULL,
			BinTreeNode<T> *rptr=NULL):data(item),left(lptr),right(rptr){}
		virtual ~BinTreeNode<T>(){}
		T& Data(void){return data;}
		const T & Data(void) const {return data;}
		BinTreeNode<T> *Left(void) const {return left;}
		BinTreeNode<T> *Right(void) const {return right;}
};

#endif