• Unlike heap, leaves are not records.

  • Records are in a separate structure (heap) ...

  • ... pointed to by nodes in the tree.


  • Not clustered. The records can be in any order.

  • So the index is not sparse.