If T is a binary tree with N nodes, then the number of levels is at least:

Coal India · Computer Science · 2017

1. A.

   ⌈log₂(N + 1)⌉

2. B.

   N − 1

3. C.

   N

4. D.

   ⌊log₂(N + 1)⌋

Attempted by 1027 students.

The worked solution is available to enrolled students.