Question

Average number of comparisons required for searching an element in binary tree is

Answer 1

Answer:

worst case is log base 2 of the number of items + 1 => 7 +1 =8. Best is always 1 if the item to be found is in the middle. If the set isn't sorted already, then sorting it takes an extra N log N comparisons before binary search can even begin.