e/Scapegoat tree

Information
has gloss	eng: In computer science, a scapegoat tree is a self-balancing binary search tree, invented by Igal Galperin, Jacób Tepěc and Ronald L. Rivest. It provides worst-case O(log n) lookup time, and O(log n) amortized insertion and deletion time.
lexicalization	eng: scapegoat tree
instance of	e/Binary tree