Recursive Analysis

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($\lfloor$ 2n/3 $\rfloor$) + $\Theta(1)$

Master: a = 1, b = 3/2, f(n) = $\Theta(1)$ = $\Theta(n^{log_{3/2} 1})$ = $\Theta(n^0)$ = $\Theta(1)$, Case 2

T(n) = .