Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00581299n
Noun Concept
Categories: Search trees, Binary trees, Amortized data structures
EN
scapegoat tree
EN
In computer science, a scapegoat tree is a self-balancing binary search tree, invented by Arne Andersson in 1989 and again by Igal Galperin and Ronald L. Rivest in 1993. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a scapegoat tree is a self-balancing binary search tree, invented by Arne Andersson in 1989 and again by Igal Galperin and Ronald L. Rivest in 1993. Wikipedia
A binary search tree used in computer science Wikipedia Disambiguation
IS A
data structure
self-balancing binary search tree
Wikipedia
EN
scapegoat tree
Wikidata
EN
scapegoat tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License