Everything About ___
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

  1. Read the overview: B-treeA 5-minute orientation
  2. Skim a recent paper: Interactive Tree of Life (iTOL) v6: recent updates to the phylogenetic tree display and annotation toolInfluential work since 2022
  3. Pick up a classic book: Magic Tree HouseThe most-reprinted book on the subject
  4. Read the landmark paper: IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood PhylogeniesCited 25,767 times
  5. Go sideways: B+ treeA closely related topic
  6. Go sideways: T-treeA closely related topic

đź“– Definitions

Noun Alternative spelling of B-tree.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics