Queues Q.133
0. The depth of a complete binary tree with 'n nodes is (log is to be base two)
- Option : A
- Explanation : If the depth is d, the number of nodes n will be 2 (d+1)-1
So, n+1 = 2(d+1) or d = log (n+1)-1
0. The depth of a complete binary tree with 'n nodes is (log is to be base two)
