查找树ADT---二叉查找树(Binary Search Tree)

template<typename Comparable>
class BinarySearchTree
{
    public:
        BinarySearchTree();
        BinarySearchTree(const BinarySearchTree &node);
        ~BinarySearchTree();

        const Comparable &findMin() const;
        const Comparable &findMax() const;
        bool contains(const Comparable &node) const;
        bool isEmpty() const;
        void printTree() const;

        void makeEmpty();
        void insert(const Comparable &node);
        void remove(const Comparable &node);

        const BinarySearchTree & operator=(const BinarySearchTree &rhs);
    
    private:
        struct BinaryNode
        {
            Comparable element;
            BinaryNode *left;
            BinaryNode *right;

            BinaryNode(const Comparable &theelement, BinaryNode *lt, BinaryNode *rt): element(theelement), left(lt), right(rt)
        }

        BinaryNode *root;

        // =========== recuris sub progress
        void insert(const Comparable &node, BinaryNode *&t) const;
        void remove(const Comparable &node, BinaryNode *&t) const;
        BinaryNode *findMin(BinaryNode *t) const;
        BinaryNode *findMax(BinaryNode *t) const;
        bool contains(const Comparable &x, BinaryNode *&t) const;
        void makeEmpty(BinaryNode *&t);
        
        void printTree(BinaryNode *t) const;
        BinaryNode *clone(BinaryNode *t) const;
}