Heaps

Question 1

Max heap

Answer 1

The root must be the maximum among all of its children

Question 2

Min heap

Answer 2

The root must be the minimum among all of its children.

Question 3

Heaps: inserting

Answer 3

1. Insert key X at the bottom of the heap
2. Heapify

Question 4

Heaps: deletion

Answer 4

1. Remove key from root
2. Replace with the last key of the heap
3. Heapify

Question 5

Heapify Code

Question 6

Heapsort code