B-Tree

B-trees are balanced tree data structures used by most relational databases as the default index structure. They maintain sorted data and support efficient lookups, range queries, inserts, and deletes in O(log n) time.

PostgreSQL, MySQL, and SQLite all use B-trees as their primary index type. Understanding B-tree behavior is essential for query optimization and index design.