Definitions from Wikipedia (Binary search tree)

▸ noun:  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.


▸ Words similar to binary search tree
▸ Usage examples for binary search tree

▸ Idioms related to binary search tree
▸ Wikipedia articles (New!)
▸ Words that often appear near binary search tree
▸ Rhymes of binary search tree

▸ Invented words related to binary search tree