binary search tree
data structure in tree form with 0, 1, or 2 children per node, sorted for fast lookup
Facts
8 properties- Instance of
- data structure
- Inception
- 1960[5]
- Subclass of
- search tree, binary tree[3][4]
- Average space complexity
- O( log_2 (n) )
- Discoverer or inventor
- Andrew Donald Booth[2]
- Studied by
- algorithmics[7]
- Time of discovery or invention
- 1960[6]
- Worst-case space complexity
- O(n!)
🏷️ Also known as
en sorted binary tree
en ordered binary tree
en BST
en binary search tree
ar شجرة بحث اثنانية
ar شجرة بحث ثنائي
cs BVS
cs binární vyhledávací strom
da Binært søgetræ
de Binärer Suchbaum
el δέντρο δυαδικής αναζήτησης
el δυαδικό δέντρο αναζήτησης
es árbol binario de busqueda
es arbol binario de búsqueda
es árbol binario de búsqueda
es arbol binario de busqueda
fa درخت جستجوی دودویی
fa درخت های جستجوی دودویی
fa درختهای جستجوی دودویی
fi binäärinen hakupuu
🔖 Identifiers · 10
- OpenAlex ID
- C91154448
- Brilliant Wiki ID
- binary-search-trees
- Dictionary of Algorithms and Data Structures ID
- binarySearchTree
- Freebase ID
- /m/01d0s
- Google Knowledge Graph ID
- /g/121pk3xb
- Microsoft Academic ID (discontinued)
- 91154448
- PlanetMath ID
- BinarySearchTree
- Quora topic ID
- Binary-Search-Tree
- Stack Exchange tag
- stackoverflow.com
- Topic's main category
- Category:Binary search trees
🔗 Connections
Subtypes 4
Subclass of 2
Discoverer or inventor 1
Instance of 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
binary search tree is a data structure[1].