nt)</p></li>
</ul>
</li>
<li><p>stack with min - each el stores min of things below it</p></li>
<li><p>queue with 2 stacks - keep popping everything off of one and putting them on the other</p></li>
<li><p>sort with 2 stacks</p></li>
</ul>
</section>
</section>
<section id="trees">
<h2><span class="section-number">6.4.2. </span>trees<a class="headerlink" href="#trees" title="Link to this heading">#</a></h2>
<ul class="simple">
<li><p>Balanced binary trees are generally logarithmic</p>
<ul>
<li><p>Root: a no