B+ Tree
A B+Tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in O(log n).
-> Generalization of a binary search tree in that a node can have more than two children.
-> Optimized for systems that read and write large blocks of data.
ref: https://www.cs.usfca.edu/~galles/visualization/BPlusTree.html
Last updated