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: 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
- Pick up a classic book: Principles of internal medicineThe most-reprinted book on the subject
- 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
- Go sideways: B+ treeA closely related topic
- Go sideways: T-treeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph
A Multigene Assay to Predict Recurrence of Tamoxifen-Treated, Node-Negative Breast Cancer
Node centrality in weighted networks: Generalizing degree and shortest paths
Diagnostic Assessment of Deep Learning Algorithms for Detection of Lymph Node Metastases in Women With Breast Cancer
OPGL is a key regulator of osteoclastogenesis, lymphocyte development and lymph-node organogenesis
Axillary Dissection vs No Axillary Dissection in Women With Invasive Breast Cancer and Sentinel Node Metastasis
Gene-expression profiles to predict distant metastasis of lymph-node-negative primary breast cancer
Gene Expression and Benefit of Chemotherapy in Women With Node-Negative, Estrogen Receptor–Positive Breast Cancer
🆕 Influential since 2022
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 trial
Sentinel Lymph Node Biopsy vs No Axillary Surgery in Patients With Small Breast Cancer and Negative Results on Ultrasonography of Axillary Lymph Nodes
Lipid nanoparticle-mediated lymph node–targeting delivery of mRNA cancer vaccine elicits robust CD8 + T cell response
Lymph node colonization induces tumor-immune tolerance to promote distant metastasis
Radiotherapy or Surgery of the Axilla After a Positive Sentinel Node in Breast Cancer: 10-Year Results of the Randomized Controlled EORTC 10981-22023 AMAROS Trial
📚 Books worth reading
Principles of internal medicineTinsley Randolph Harrison, Kurt J. Isselbacher · 1950
Data structures and algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2001
CytologyEdmund S. Cibas, Barbara S. Ducatman · 1996
Reaction Patterns of the Lymph NodeE. Grundmann, E. Vollmer · 1990
Textbook of melanomaJohn F. Thompson, Donald L. Morton · 2003
Mathematical programming at Oberwolfach IIB. H. Korte, M. L. Balinski · 1984
Data structures & algorithms in JavaRobert Lafore · 2003- 📕Sentinel lymph nodes in human solid cancerStanley P. L. Leong · 2000
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…