lest value in the given binary tree (not necessarily a binary <em><strong>search</strong></em> tree). Have your function throw an error if the initial tree is empty. Write a corresponding recursive version of this function that works on BSTs, and then write an iterative version of the BST function as well.</p>
<p>10. Write a function that takes the root of a binary tree and frees all dynamically allocated memory associated with that tree. Test that your function works by adding <span class="code-chonk">#inc