Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03092934n
Noun Concept
EL
No term available
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
Relations
Sources
IS A
δυαδικό δέντρο αναζήτησης
HAS KIND
EN
(a,b)-tree
EN
WAVL tree
EN
AA tree
HAS INSTANCE
EN
scapegoat tree
avl δέντρο
SAID TO BE THE SAME AS
EN
balanced binary tree
STUDIED BY
θεωρία γράφων

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