Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03092934n
Noun Concept
Categories: Binary trees, Trees (data structures)
EN
self-balancing binary search tree  Admissible tree  balanced binary search tree  balanced binary tree  balanced tree
EN
In computer science, a self-balancing binary search tree is any node-based binary search tree that automatically keeps its height small in the face of arbitrary item insertions and deletions. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a self-balancing binary search tree is any node-based binary search tree that automatically keeps its height small in the face of arbitrary item insertions and deletions. Wikipedia
Computing Wikipedia Disambiguation
IS A
binary search tree
HAS KIND
(a,b)-tree
WAVL tree
AA tree
HAS INSTANCE
scapegoat tree
AVL tree
SAID TO BE THE SAME AS
balanced binary tree
STUDIED BY
graph theory
Wikipedia
EN
self-balancing binary search tree
Wikidata
EN
self-balancing binary search tree
Wikipedia Redirections
EN
Admissible tree, balanced binary search tree, balanced binary tree, balanced tree, balanced trees, Binary self-balancing search tree, Height-balanced binary search tree, Height-balanced binary tree, height-balanced tree, Relaxed balance, Root balance, SBB tree, Self-balancing binary tree
Wikidata Alias
EN
self balancing binary search 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