B-Tree Data Structure: Search, Insertion, and Deletion
From Connected Components of Chaos · · 17 min
This plays from the publisher's own server. We do not host a copy.
Not rated yet
Description
Jump in and discover the B-tree data structure, a fundamental tool for processing queries on one-dimensional data stored on disk. We explain how B-trees efficiently support range reporting, successor/predecessor searches, insertion, and deletion operations.
Visit our website here:https://sites.google.com/view/connected-components/home