nts at the beginning of our data structure.</li>
</ul>
<ul>
<li>A key benefit of BSTs over linked lists is that if we keep a BST balanced, we get efficient search runtimes of O(log n). With a linked list, even if our elements are sorted, our worst-case runtime for search is O(n). (And of course, we have talked <em>ad nauseam</em> about how much better logarithmic runtimes are than linear runtimes. What is log<sub>2</sub>(1,000,000,000) again? üòâ)</li>
</ul>
<p>There are a few drawbacks to BSTs compar