Question: 3. (2 points) Consider a binary tree with L leaves. The number of levels is at least: (a) O(L (b) O(log L) (c) O(L) (d)O(24)

3. (2 points) Consider a binary tree with L leaves. The number of levels is at least: (a) O(L (b) O(log L) (c) O(L) (d)O(24) Explain your answers. One point for correct answer and one point for explanation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
