="avl_set_multiset.html#intrusive.avl_set_multiset.set_multiset_containers">avl_set,
      avl_multiset and avltree containers</a></span></dt>
<dt><span class="section"><a href="avl_set_multiset.html#intrusive.avl_set_multiset.avl_set_multiset_example">Example</a></span></dt>
</dl></div>
<p>
      Similar to red-black trees, AVL trees are balanced binary trees. AVL trees
      are often compared with red-black trees because they support the same set of
      operations and because both take O(log n) time fo