(Choose 1 answer)
A. 7
What is the minimum number of nodes in a nearly complete binary tree with height 4?(In a tree the height of root is 1, and a binary tree with height h is called nearly complete if the tree is complete at level d for d = 1, 2, ..., h-1, and the leaves in the last level are all in the leftmost positions).
B. 9
C. 6
D. 8
Exit 1
