Binary Search Tree

B‑trees keep disk reads low and writes efficient, making them the preferred index structure in databases and filesystems.