Live briefing
Everything about Binary search tree
Rooted binary tree data structure
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 internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is linear with respect to the height of the tree. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Binary search treeA 5-minute orientation
- Skim a recent paper: Genomes on a Tree (GoaT): A versatile, scalable search engine for genomic and sequencing project metadata across the eukaryotic tree of lifeInfluential work since 2022
- Pick up a classic book: Expected performance of m-solution backtrackingThe most-reprinted book on the subject
- Read the landmark paper: Mastering the game of Go with deep neural networks and tree searchCited 12,028 times
- Go sideways: AVL treeA closely related topic
- Go sideways: Scapegoat treeA closely related topic
📖 Definitions
Noun A tree (data structure) set up to facilitate searching.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Mastering the game of Go with deep neural networks and tree search
Multidimensional binary search trees used for associative searching
ESTIMATING CHARACTER WEIGHTS DURING TREE SEARCH
Independence of alignment and tree search
Information Set Monte Carlo Tree Search
Monte Carlo Tree Search in Hex
A practical concurrent binary search tree
Parallel Game-Tree Search
🆕 Influential since 2022
Genomes on a Tree (GoaT): A versatile, scalable search engine for genomic and sequencing project metadata across the eukaryotic tree of life
Monte Carlo Tree Search: a review of recent modifications and applications
Predicting the structure of large protein complexes using AlphaFold and Monte Carlo tree search
Retrosynthetic planning with experience-guided Monte Carlo tree search
An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search
📚 Books worth reading
- 📕Expected performance of m-solution backtrackingDavid Nicol · 1986
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013- 📕Efficient search treesArne Andersson · 1990
The Artificial Gardiner: Being, a Discovery of a New Invention for the Sudden Growth of All ...Richard Bradley , Georg Andreas Agricola · 1717
PlantsAlex Balian, Mark Falstein · 1979
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- AVL tree In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights…
- Scapegoat tree In computer science, a scapegoat tree is a self-balancing binary search tree, invented by Arne Andersson in 1989 and rediscovered by Igal Galperin and…
- Self-balancing binary search tree In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number…
- Weight-balanced tree In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionari…
- Red–black tree In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information…
- Treap In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain…
- Join-based tree algorithms In computer science, join-based tree algorithms are a class of algorithms for self-balancing binary search trees. This framework aims at designing highly-parall…
- WAVL tree In computer science, a WAVL tree or weak AVL tree is a self-balancing binary search tree. WAVL trees are named after AVL trees, another type of balanced…