1.

The depth dn, of complete binary tree of n nodes, where nodes are labeled from 1 to n with root as node 1 and last leaf node as node n is(A) [ log2 n − 1 ](B) [log2 n + 1 ](C) [ log2 n + 1](D) [ log2 n − 1]

Answer»

Correct option- (C) [ log2 n + 1]



Discussion

No Comment Found

Related InterviewSolutions