Q1.25

B-trees are for storing data on disk and B$^+$ trees are for main memory.

Range queries are faster on B$^+$ trees.

B-trees are for primary indexes and B$^+$ trees are for secondary indexes.

The height of a B$^+$ tree is independent of the number of records.