bitreenode.h

数据结构c++-书的一些源代码

template <class T> class BiTreeNode
{
	private:
		BiTreeNode<T> *leftChild;
		BiTreeNode<T> *rightChild;
	public:
		T data;
		BiTreeNode():leftChild(NULL), rightChild(NULL){}
		BiTreeNode(const T& item, BiTreeNode<T> *left = NULL, BiTreeNode<T> *right = NULL):
			data(item), leftChild(left), rightChild(right){}
		~BiTreeNode(){}

		BiTreeNode<T> *Left(void)const
			{return leftChild;}
		BiTreeNode<T> *Right(void)const
			{return rightChild;}
		BiTreeNode<T> *GetTreeNode(T item,BiTreeNode<T> *left=NULL,BiTreeNode<T> *right=NULL);
};

template <class T>
BiTreeNode<T> *GetTreeNode(T item, BiTreeNode<T> *left = NULL, BiTreeNode<T> *right = NULL)
{
	BiTreeNode<T> *p;
	p = new BiTreeNode<T> (item, left, right);
	
	if(p == NULL)
	{
		cerr << "内存分配失败!\n";
		exit(1);
	}
	return p;
}