1.

The minimum number of nodes in a binary tree of depth d (root is at level 0) is

A. 2d - 1
B. 2d + 1 - 1
C. d + 1
D. d
Answer» D. d


Discussion

No Comment Found