family:arial, sans-serif;font-size:16px;color:#222222;background-color:#FFFFFF;">In computer science, a B - tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B - tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123).