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: Abemaciclib plus endocrine therapy for hormone receptor-positive, HER2-negative, node-positive, high-risk early breast cancer (monarchE): results from a preplanned interim analysis of a randomised, open-label, phase 3 trialInfluential work since 2022
  3. Pick up a classic book: Principles of internal medicineThe most-reprinted book on the subject
  4. Read the landmark paper: MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graphCited 10,090 times
  5. Go sideways: B+ treeA closely related topic
  6. Go sideways: T-treeA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 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