r basic operations. AVL trees
      are more rigidly balanced than Red-Black trees, leading to slower insertion
      and removal but faster retrieval, so AVL trees perform better than red-black
      trees for lookup-intensive applications.
    </p>
<p>
      <span class="bold"><strong>Boost.Intrusive</strong></span> offers 3 containers based
      on avl trees: <code class="computeroutput"><a class="link" href="../boost/intrusive/avl_set.html" title="Class template avl_set">avl_set</a></code>,
      <code