
<li><p>m operations will take m*log(n) time</p></li>
</ul>
</li>
</ul>
</li>
</ul>
</section>
<section id="other-trees">
<h3><span class="section-number">6.4.2.4. </span>other trees<a class="headerlink" href="#other-trees" title="Link to this heading">#</a></h3>
<ul class="simple">
<li><p>to go through <em>bst (without recursion) in order</em>, use stacks</p>
<ul>
<li><p>push and go left</p></li>
<li><p>if can‚Äôt go left, pop</p>
<ul>
<li><p>add new left nodes</p>
<ul>
<li><p>go right</p></li>
</ul>
<