Assuming that the values 1 to 7 are equally likely (if chosen randomly):

Draw a 7-node binary search tree containing these values that would, on average, give the fewest number of comparisons.

I'm not exactly sure how to answer this question

This topic has been dead for over six months. Start a new discussion instead.

Recommended Topics