till be possible to proceed with a linked data structure that spreads its nodes across memory.</li>
</ul>
<ul>
<li>BSTs are great for streaming input. If we want to be able to binary search a collection of values, and all those values are provided to us ahead of time, sure -- we can just throw them into an array of the appropriate size, sort the array, and do binary search from there. However, if we have a situation where new values could stream into our collection at any time after we have already started 