Extend the optimal binary search tree algorithm to allow for unsuccessful searches.In
Chapter 10, Problem 10.33(choose chapter or problem)
Extend the optimal binary search tree algorithm to allow for unsuccessful searches.In this case, qj, for 1 j < N, is the probability that a search is performed for anyword W satisfying wj < W < wj+1. q0 is the probability of performing a searchfor W < w1, and qN is the probability of performing a search for W > wN. Noticethat Ni=1 pi + Nj=0 qj = 1.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer