 *root, int data)</span> function that returns <span class="code-chonk">true</span> if the given binary tree (not necessarily a binary <em><strong>search</strong></em> tree) contains <span class="code-chonk">data</span>, <span class="code-chonk">false</span> otherwise. 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>9. Write a <span class="code-chonk">findMin(Node *root)</span> function that returns the smal