An LSM tree makes every write a quick insert in memory and writes to disk only in big sorted batches. Reads pay for that: they check newest to oldest across several tables, so background compaction keeps merging tables down into fewer, larger levels.