Live briefing
Everything about Optimal binary search tree
Computer science concept
In computer science, an optimal binary search tree, or optimal BST, sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time for a given sequence of accesses. Optimal BSTs are generally divided into two types: static and dynamic. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Optimal binary search treeA 5-minute orientation
- Skim a recent paper: Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problemInfluential work since 2022
- Pick up a classic book: Computational Linguistics and Intelligent Text ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Nearly optimal binary search treesCited 75 times
- Go sideways: Splay treeA closely related topic
- Go sideways: Geometry of binary search treesA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Nearly optimal binary search trees
Optimal Binary Search Trees with Restricted Maximal Depth
Optimal binary search trees
Search cost for a nearly optimal path in a binary tree
Thresholds and optimal binary comparison search trees
Greedy binary search trees are nearly optimal
Optimal alphabetic trees for binary search
Binary search trees of almost optimal height
🆕 Influential since 2022
📚 Books worth reading
Computational Linguistics and Intelligent Text ProcessingAlexander Gelbukh · 2003
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Fundamentals of data structures in CEllis Horowitz · 1993
Computer algorithmsEllis Horowitz · 1997
Neuro-fuzzy and soft computingJyh-Shing Roger Jang, Chuen-Tsai Sun · 1996
Fundamentals of computer algorithmsEllis Horowitz · 1978
Data structures, algorithms, and applications in C++Sartaj Sahni · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Splay tree A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary…
- Geometry of binary search trees In computer science, one approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometricall…
- Tango tree A tango tree is a type of binary search tree proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătrașcu in 2004. It is named after Buenos…
- Huffman coding In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression…
- Garsia–Wachs algorithm The Garsia–Wachs algorithm is an efficient method for computers to construct optimal binary search trees and alphabetic Huffman codes, in linearithmic…
- Binary search In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position…
- Binary search tree In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each…
- Random binary tree In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees…