B-Tree
A B-tree is a self – balancing tree data structure that keeps data sorted and allows searches, insertions, and deletions in O(log N) time.
A B-tree is a self – balancing tree data structure that keeps data sorted and allows searches, insertions, and deletions in O(log N) time.