Question: A complete binary tree of N elements uses array positions 1 through N. Determine how large the array must be for
a. A binary tree that has two extra levels (i.e., is slightly unbalanced)
b. A binary tree that has a deepest node at depth 2 log N
c. A binary tree that has a deepest node at depth 4.1 log N
d. The worst-case binary tree