)</em></span></span><span style="font-size: 10pt; background-color: #ced4d9; color: #ced4d9;"> function doesn't need to modify the tree, and so it has no need to be able to go back to the calling function and modify the pointer stored there -- which is what a reference would allow us to do.</span></p>
<p>6. In class today, we saw an iterative version of <span class="code-chonk">bstFindMax()</span> that works for non-empty BSTs. Write a recursive version of <span class="code-chonk">bstFindMax()</span> that a