B-tree — high fanout

B-tree — பல keys/children; disk block model.

Try this in Python

# Keys per node sorted; children intervals between keys (concept sketch)
node_keys = [10, 20, 30]
# child i covers keys < node_keys[i] (simplified story)
print(len(node_keys) + 1, "child slots in a full B-tree node sketch")

Key takeaways

• Large fanout — short height.
• Split full nodes.
• DB/filesystems.