Question: If a complete balanced binary tree has N nodes, then the height is Select one: O a. Log(N)/2 b. Log(N+1)-1 O c. Log(N+1)/2) O d.

If a complete balanced binary tree has N nodes, then the height is Select one: O a. Log(N)/2 b. Log(N+1)-1 O c. Log(N+1)/2) O d. Log(N+1)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
