node.h

一个最简单的二叉树的算法

template<class T>class BinaryTree;
template<class T>class LinkQuee;
template<class T>
class BinaryTreeNode
{
	friend class LinkQuee<T>;
	friend class BinaryTree<T>;
public:
	BinaryTreeNode()
	{
		Left = Right = 0;
	}
	BinaryTreeNode(const T &x)
	{
		data = x;
		Left = Right = 0;
	}
private:
	T data;
	BinaryTreeNode<T> *Left, *Right;
};