If we are searching a list of items for a specific item we knowis in the list, how many
comparisons will we use in the worst case? How many comparisonswill we use on
average? Be exact with your answer.
What is the depth of a binary heap with 1337 items in it (assumethe root has depth 0)?
How many operations (big-O) will it take for a binary heap toremove the root and then
satisfy the heap invariant?
Answer