btnode.h

常用算法与数据结构原代码

#ifndef BinaryTreeNode_
#define BinaryTreeNode_

template <class T> class BinaryTree;
template<class E, class K> class DBSTree;

template <class T>
class BinaryTreeNode 
{
	friend BinaryTree<T>;
	friend DBSTree<T,int>;
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