EPISODE · Jul 16, 2020 · 15 MIN
B Trees Research Paper (1970)
from Programmers · host Software Engineering
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 for nodes with more than two children.[2] Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as discs. It is commonly used in databases and file systems.
NOW PLAYING
B Trees Research Paper (1970)
No transcript for this episode yet
Similar Episodes
Apr 25, 2026 ·53m
Apr 12, 2026 ·55m
Mar 31, 2026 ·48m
Mar 21, 2026 ·58m
Mar 5, 2026 ·40m