Dear Wikiwand AI, let's keep it short, summarize this topic like I'm... Ten years old or a College student
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. 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 databases and file systems.
A self-balancing, tree-based data structure, that allows read/write access in logarithmic time