Lab Exercise

$2-27-2024$

Heaps

Part A $-$ MaxHeap:

$\backslash$table$[[50,11,49,72,98,3,65,51,24,36]]$

Using the array$/$list of integers above, create a MaxHeap.

Insert numbers $23,55,$&$100,$ respectively into the MaxHeap, and showcase the updated version of the heap after it's heapified.

Remove the maximum node $($or root$)$ from the Maxheap, and showcase the updated version of the heap after it's heapified.

Part B $-$ MinHeap:

$\backslash$table$[[50,11,49,72,98,3,65,51,24,36]]$

Using the array$/$list of integers above, create a MinHeap.

Insert numbers $23,55,$&$100,$ respectively into the MinHeap, and showcase the updated version of the heap after it's heapified.

Remove the minimum node $($or root$)$ from the Minheap, and showcase the updated version of the heap after it's heapified.

Part C $-$ Binominal Heap:

$\backslash$table$[[50,11,49,72,98,3,65,51,24,36]]$

Using the array$/$list of integers above, create a Binomial Heap $($it is your choice to create this heap as a MaxHeap or MinHeap$).$

Insert numbers $23,55,$&$100,$ respectively into the Binomial Heap, and showcase the updated version of the heap.

Based on your selection of using a MaxHeap or MinHeap to create your Binomial Heap, extract the max or min node from the heap and showcase the updated version of the heap. Meaning if you created a MaxHeap, then you need to extract the maximum value $($or root$).$ Likewise, if you created a MinHeap, then you need to extract the minimum value $($or root$).$