n = 5,
*n*_{subtree} =
= 3

Note that this expression has the maximum value when the lowest level of the
heap is exactly half full.

T(n) = T( 2n/3 ) +

Master: a = 1, b = 3/2, f(n) = =
=
= , Case 2

T(n) = .