📅  最后修改于: 2022-03-11 15:00:36.340000             🧑  作者: Mango
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