6 docs tagged with "b-tree"

A B-Tree is a self-balancing tree data structure that maintains sorted data and allows for efficient insertion, deletion, and search operations.

A comprehensive guide to deleting keys from a B-Tree, covering leaf deletion, internal node deletion, borrowing from siblings, and node merging.

Removing a key from a B-tree while maintaining balance

Inserting a key into a B-tree while maintaining its properties.

A B-tree is a self-balancing tree data structure that maintains sorted data for efficient insertion, deletion, and search operations.

A B-tree is a self-balancing tree data structure that maintains sorted data for efficient insertion, deletion, and search operations.