Question: (a) Define concisely what a binary max-heap is (recall the special shape, and the special relation between the values (keys) of the nodes). Give an

(a) Define concisely what a binary max-heap is (recall the special shape, and the special relation between the values (keys) of the nodes). Give an example of a binary max-heap with 7 vertices, and an example of a binary tree which is not a binary max-heap (state reasons why it is not a binary max-heap). [8 marks]

(b) Explain the informal argument that QUICK-SORT has run-time O(nlog n) on average, including an outline of the algorithm and how the Master The- orem could be applied.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!