• We are doing a (B-1)-way merge, so we have a tree of degree B-1.

  • We are merging N/B runs.

  • So the tree height is logB-1(N/B).

  • + 1: Cost to form the initial runs.