bitree.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(  )
        {
            return leftChild;
        }
        BiTreeNode<T>*&Right(     )
        {
            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<<"can't get the store!"<<endl;
        exit(0);
    }
    return p;
}