bitreenode.h

数据结构头文件源代码

template<class T>class BiTreeNode
{
	private:
		BiTreeNode<T>*leftChild;
		BiTreeNode<T>*rightChild;
	public:
		T data;
		BiTreeNode():leftChild(NULL),rightChild(NULL){}
		BiTreeNode(T item,BiTreeNode<T>*left=NULL,
			BiTreeNode<T>*right=NULL):
		data(item),leftChild(left),rightChild(right){}
		~BiTreeNode(){}
		BiTreeNode<T>*&Left(void)
		{return leftChild;}
		BiTreeNode<T>*&Right(void)
		{return rightChild;}
};
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)
	{
		cout<<"内存分配失败!\n";
		exit(0);
	}
	return p;
}