ssumes the BST it receives is non-empty.</p>
<p>7. Write a version of <span class="code-chonk">findMax()</span> that works for arbitrary binary trees (not necessarily binary <em><strong>search</strong></em> trees). In the case of an empty tree, have your function return <span class="code-chonk">numeric_limits&lt;int&gt;::min()</span>, which you can use if you <span class="code-chonk">#include &lt;limits&gt;</span> at the top of your program.</p>
<p>8. Write a recursive <span class="code-chonk">contains(Node