binarytreenode.h

以二叉链表作为存储结构

#ifndef BINARYTREENODE_CLASS
#define BINARYTREENODE_CLASS
#ifndef NULL
const int NULL=0;
#endif

enum boolean{FALSE,TRUE};
#include<stdlib.h>
template<class T>
class BinaryTreeNode
{
	public:
		T data;
		BinaryTreeNode<T> * LeftChild,* RightChild;
		   //分别指向左子树根和右子树根结点的指针
		BinaryTreeNode(void){LeftChild=RightChild=NULL;}
		BinaryTreeNode(const T&e)
		{
			data=e;
			LeftChild=RightChild=NULL;
		}
		BinaryTreeNode(const T&e,BinaryTreeNode *l,BinaryTreeNode *r)
		{
			data=e;
			LeftChild=l;
			RightChild=r;
		}
		void FreeBTreeNode(BinaryTreeNode<T> *p){delete p;}
		BinaryTreeNode<T> *GetBTreeNode(T&item,BinaryTreeNode<T> * lptr=NULL,
			               BinaryTreeNode<T>*rptr=NULL);
};

template<class T>
BinaryTreeNode<T> *BinaryTreeNode<T>::GetBTreeNode(T&item,BinaryTreeNode<T> * lptr,
			               BinaryTreeNode<T>*rptr)
		{
	        BinaryTreeNode<T> *p;
	        p=new BinaryTreeNode<T>(item,lptr,rptr);
	        if(p==NULL)
                  cout<<"Memory allocation failure! "<<endl;
	        return p;
		}
#endif