The depth of a complete binary tree with n nodes is-?

The number of elements in a complete, balanced, binary tree is N = 2D - 1, where D is the depth. Simply solve for D...

N = 2D - 1

N + 1 = 2D

log2 (N + 1) = D