bitrthnode.h

来自「数据结构c++-书的一些源代码」· C头文件 代码 · 共 35 行

#include <stdlib.h>

template <class T> class BiTrThNode
{
	public:
		int leftThread;
		int rightThread;
		BiTrThNode<T> *leftChild;
		BiTrThNode<T> *rightChild;
		T data;

		BiTrThNode(): leftThread(0), rightThread(0), leftChild(NULL), rightChild(NULL){}
//		BiTrThNode(BiTrThNode<T> *left): 
//			leftThread(0),leftChild(left), rightThread(0), rightChild(NULL){}

		BiTrThNode(const T& item, BiTrThNode<T> *left = NULL, BiTrThNode<T> *right = NULL):
			data(item), leftChild(left), rightChild(right), leftThread(0), rightThread(0){}
};

//定义一个由结点构造线索二叉树的外部函数
template <class T>
BiTrThNode<T> *GetTrThNode(T item, BiTrThNode<T> *left = NULL, 
			BiTrThNode<T> *right = NULL , int leftThread = 0, int rightThread = 0)
{
	BiTrThNode<T> *p;
	p = new BiTrThNode<T> (item, left, right);
	
	if(p == NULL)
	{
		cerr << "内存分配失败!\n";
		exit(1);
	}
	return p;
}