Insertion If child pointers are not leaf nodes   Choose subtree with least volume increase (as before) If child pointers are leaf nodes (level leaf-1)   Choose subtree with least overlap enlargement   Overlap ( ) = sum of volume( \ ) for all other entries   because entries need to be checked and each entry, overlap to be calculated for siblings