 +1 -&gt; needs left then right</p></li>
<li><p>Find: Œò(log n) time: height of tree is always Œò(log n)</p></li>
<li><p>Insert: Œò(log n) time: find() takes Œò(log n), then may have to visit every node on the path back up to root to perform up to 2 single rotations</p></li>
<li><p>Remove: Œò(log n): left as an exercise</p></li>
<li><p>Print: Œò(n): no matter the data structure, it will still take n steps to print n elements</p></li>
</ul>
</li>
</ul>
</section>
<section id="red-black-trees">
<h