Array (1-based): 16 15 10 8 7 9 3 2 4 1 

index  value  parent  left  right
    1     16       -     2      3
    2     15       1     4      5
    3     10       1     6      7
    4      8       2     8      9
    5      7       2    10      -
    6      9       3     -      -
    7      3       3     -      -
    8      2       4     -      -
    9      4       4     -      -
   10      1       5     -      -

height of the heap = floor(lg 10) = 3
leaves occupy positions 6 .. 10

Nodes at each height h, against the bound ceil(n/2^(h+1)):
  h = 0 : actual = 5, bound = 5
  h = 1 : actual = 3, bound = 3
  h = 2 : actual = 1, bound = 2
  h = 3 : actual = 1, bound = 1

max-heap property holds: yes
