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

You can also use recursion, you just need to change the function header to:

void remove(node*& root) 

and it will work.