The key if you don't know the details about how B+ trees work is to note that they are balanced indexes, guaranteeing O(log n) insertion and deletions. If you know more about how they work, then you can go into how their wide structure allows records to be accessed in only a few disk accesses.