Question: Hash tables and optimal binary search trees 3. Let Ple) be the probability of an event e, and let n be an integer. The probabilities
Hash tables and optimal binary search trees

3. Let Ple) be the probability of an event e, and let n be an integer. The probabilities of n having certain values are shown below. Pn 6) = 0.0125 3a. (10 points.) Suppose we want to search an OBST to see if it has a key n. Using these probabilities, construct an OBST in which search succeeds when ne {1, 3, 5 }, but fails otherwise. 3b. (10 points.) Prove that the OBST you constructed in 3a is optimal. (These two questions are related: answering one may answer the other too.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
