B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.

B-Tree used in file systems to allow quick random access to an arbitrary block in a particular file, placing and locating the records databases and any sortable data applications. B-Tree may contain more than one child nodes. The records are stored in locations called leaves and allow to access the record faster. B-tree is optimized for systems that read and write large blocks of data.

B-tree section explains how to implement the B-tree and various applications related with B-tree operation.

Data structure problems
129 B Tree implementation
B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.