/li>
<li><p>maximum number of nodes in tree of height h is 2^(h+1) - 1</p></li>
<li><p>minimum height h ‚â• log(n+1)-1</p></li>
<li><p>Perfect Binary tree - impractical because you need the perfect amount of nodes</p>
<ul>
<li><p>all leaves have the same depth</p></li>
<li><p>number of leaves 2^h</p></li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
</ul>
<section id="avl-tree">
<h3><span class="section-number">6.4.2.1. </span>AVL Tree<a class="headerlink" href="#avl-tree" title="Link to this heading">#</a></h3