Binary Search Tree Destructor

Question

Working on implementing my own BST in C++ for the experience of dealing with such structures.

I\'ve had trouble implementing a destructor. I found in my studies, that on

Answer 1

How about automating it:

class BinSearchTree
{
    std::auto_ptr   left;
    std::auto_ptr   right;

    BinSearchTree(BinSearchTree const&);
    BinSearchTree& operator=(BinSearchTree const&); // private
};

Now destruction is automatic. :-)