fffff;">WARNING!</span><em> This function assumes root is non-null!</em></span><strong><br />int</strong> bstFindMax(<strong>Node </strong>*root)<br />{<br /><span style="color: #236fa1;"><em>   // To find the largest value in a BST, simply go right until we can't go<br />   // right anymore!</em></span><br />   <strong>while</strong> (root-&gt;right != <strong>nullptr</strong>)<br />   {<br />      root = root-&gt;right;<br />   }<br /><br />   <strong>return</strong> root-&gt;data;<br />}</pre>
<p><strong