查<br>
<span class="equation-text" data-index="0" data-equation="O(h)" contenteditable="false"><span></span><span></span></span>
设<span class="equation-text" data-index="0" data-equation="n_h" contenteditable="false"><span></span><span></span></span>为深度h的AVL树中最少的节点数
<span class="equation-text" data-index="0" data-equation="n_0=0,n_1=1,n_h=n_{h-1}+n_{h-2}+1" contenteditable="false"><span></span><span></span></span>
ie. 最坏的情况下，含<span class="equation-text" data-index="0" data-equation="n_h" contenteditable="false"><span></span><span></span></span>结点的AVL树不超过<span class="equation-text" data-index="1" data-equation="h" contenteditable="false"><span></span><span></span></span>层，<span class="equation-text" data-index="2" data-equation="h" contenteditable="false"><span></span><span></span></span>参见上式<br>
另有<br>
<span class="equation-text" data-index="0" data-equation="h\le\log_2{n}" contenteditable="false"><span></span><span></span></span><br>
<span class="equation-text" data-index="0" data-equation="ASL=\log_2n" contenteditable="false"><span></span><span></span></span><br>
