an class="bold"><strong><span class="emphasis"><em>height(tree) &lt;= log1/a(tree.size()) + 1</em></span></strong></span>
    </p>
<p>
      Scapegoat trees support any a between 0.5 and 1. If a is higher, the tree is
      rebalanced less often, obtaining quicker insertions but slower searches. Lower
      a values improve search times. Scapegoat-trees implemented in <span class="bold"><strong>Boost.Intrusive</strong></span>
      offer the possibility of <span class="bold"><strong>changing a at run-time</