pan><span class="n">right</span><span class="p">);</span>
<span class="p">}</span>
</pre></div>
</div>
<ul class="simple">
<li><p>BST Remove</p>
<ul>
<li><p>if no children: remove node (reclaiming memory), set parent pointer to null
- one child: Adjust pointer of parent to point at child, and reclaim memory
- two children: successor is min of right subtree
- replace node with successor, then remove successor from tree</p>
<ul>
<li><p>worst-case depth = n-1 (this happens when the data is already sorted)</p><