B-tree - WikipediaIn 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] By allowing more children under one node than a regular self-balancing binary search tree, the B-tree reduces the heig
