</span></dt>
<dt><span class="section"><a href="sg_set_multiset.html#intrusive.sg_set_multiset.sg_set_multiset_example">Example</a></span></dt>
</dl></div>
<p>
      A scapegoat tree is a self-balancing binary search tree, that provides worst-case
      O(log n) lookup time, and O(log n) amortized insertion and deletion time. Unlike
      other self-balancing binary search trees that provide worst case O(log n) lookup
      time, scapegoat trees have no additional per-node overhead compared to a regular
   