https://latex.codecogs.com/gif.download?%7Bn%5Cover2%7D+%7Bn%5Cover4%7D+%7Bn%5Cover8%7D+%7Bn%5Cover16%7D+...+1%20%3D%20n%5Cleft%28%7B1%5Cover2%7D+%7B1%5Cover4%7D+%7B1%5Cover8%7D+%7B1%5Cover16%7D+...+%7B1%5Cover%20n%7D%20%5Cright%20%29%20%3C%20n" /></p>
<p>Thus, our runtime for heapify is O(n).</p>
<p><br /><strong>So, Why BSTs?</strong></p>
<p>We then shifted gears a bit to talk about why we would ever want to use a BST to store data as opposed to, say, a vector, an array, or even a linked list. Here is a s