Live briefing
Everything about B-tree
Tree-based computer data structure
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing nodes to have more than two children. Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: B-treeA 5-minute orientation
- Skim a recent paper: Interactive Tree of Life (iTOL) v6: recent updates to the phylogenetic tree display and annotation toolInfluential work since 2022
- Pick up a classic book: Magic Tree HouseThe most-reprinted book on the subject
- Read the landmark paper: IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood PhylogeniesCited 25,767 times
- Go sideways: B+ treeA closely related topic
- Go sideways: T-treeA closely related topic
đź“– Definitions
Noun Alternative spelling of B-tree.
🏆 Landmark papers (most cited)
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
IQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era
Mastering the game of Go with deep neural networks and tree search
Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation
STRING v10: protein–protein interaction networks, integrated over the tree of life
z-Tree: Zurich toolbox for ready-made economic experiments
A global overview of drought and heat-induced tree mortality reveals emerging climate change risks for forests
The automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations
🆕 Influential since 2022
Interactive Tree of Life (iTOL) v6: recent updates to the phylogenetic tree display and annotation tool
Tree Visualization By One Table (tvBOT): a web application for visualizing, modifying and annotating phylogenetic trees
A DNA barcoding framework for taxonomic verification in the Darwin Tree of Life Project
Greengenes2 unifies microbial data in a single reference tree
Exploring and retrieving sequence and metadata for species across the tree of life with NCBI Datasets
📚 Books worth reading
Magic Tree HouseMary Pope Osborne · 2013- 📕Central Park Trees and LandscapesEdward S. Barnard, Neil Calvanese · 2016
Happy Birthday, TreeMadelyn Rosenberg · 2012- 📕B-trees for BASICRaymond Robertson · 1992
- 📕James J. Guthrie and the Pear Tree Press. · 1968
The Riverview LandsVal Adolph, B. Guild Gillespie · 1994
Wholesale catalogue with descriptions and illustrationsChas. B. Hornor (Firm) · 1890
Grow trees from Fleu's seedsConyers B. Fleu, Jr. (Firm) · 1930
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- B+ tree A B+ tree is an m-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes, and leaves. The root…
- T-tree In computer science a T-tree is a type of binary tree data structure that is used by main-memory databases, such as Datablitz, eXtremeDB, MySQL Cluster…
- Leftist tree In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node x has an s-value which…
- Queap In computer science, a queap is a priority queue data structure. The data structure allows insertions and deletions of arbitrary elements, as well as retrieval…
- Tree (abstract data type) In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node…
- 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…
- Binary heap A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary…
- Tree traversal In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting…