Question: (a) Construct a 23 tree for the list h, y, d, r, o, m, a, g, n, e, t, i, c. Use the alphabetical order
(b) Assuming that the probabilities of searching for each of the keys (i.e., the letters) are the same, find the largest number and the average number of key comparisons for successful searches in this tree.
Step by Step Solution
3.40 Rating (150 Votes )
There are 3 Steps involved in it
SOLUTION A We know a 23 tree has either one element at parent with two children or two elements at p... View full answer
Get step-by-step solutions from verified subject matter experts
