Data Structures :: Trees - Discussion
Home > Data Structures > Trees > MCQs Questions Discussion
10 / 194
Choose the correct option.
The number of leaf nodes in a complete binary tree of depth d is
A2^d
B[2^(d-1)]+1
C[2^(d+1)]+1
D(2^d)+1
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!