The number of nodes in a complete binary tree of depth d (with root at depth 0) is
A. 2d−1 +1
B. 2d+1 -1
C. 2d−1 -1
D. 2d+1 +1
Answer:B
The number of nodes in a complete binary tree of depth d (with root at depth 0) is
A. 2d−1 +1 B. 2d+1 -1 C. 2d−1 -1 D. 2d+1 +1