Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03178672n
Noun Concept
Categories: long volume value, Articles with short description, Binary trees, Search trees
EN
binary search tree  binary search trees  BST  ordered binary tree  sorted binary tree
EN
In computer science, a binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. Wikipedia
A data structure Wikipedia Disambiguation
Data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup Wikidata
IS A
data structure
binary tree
search tree
HAS KIND
treap
splay tree
order statistic tree
self-balancing binary search tree
threaded binary tree
+3 relations
HAS INSTANCE
treap
DISCOVERER OR INVENTOR
Andrew Donald Booth
STUDIED BY
graph theory
Wikipedia
EN
binary search tree
Wikidata
EN
binary search tree
Wikipedia Redirections
EN
Binary Search Tree, binary search trees, Ordered binary tree
Wikidata Alias
EN
BST, ordered binary tree, sorted binary 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