In computer science, a scapegoat tree is a self-balancing binary search tree, discovered by Arne Andersson and again by Igal Galperin and Ronald L. Rivest.
双语例句
1
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 binary search tree.