Question: How many leaf nodes does a binary tree of height h have? at most 2^h leaves a minimum of Ig h leaves O a minimum



How many leaf nodes does a binary tree of height h have? at most 2^h leaves a minimum of Ig h leaves O a minimum of 2^h leaves it always has 21h leaves at most Ig h leaves Which of the following is the power-law equation? OT(n) = n^b OT(n) = 2^a nab OT(n) = a nb OT(n) = a n'b The best-case quick sort has which of the following recurrence relation? OT(n) = T(n/2)+n OT(n) = 2 Tin/2) +n OT(n) = 2 T(n/2) + 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
