A **B-tree** is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access,