Data Structures and Algorithms (CS 130A) Prof. Suri Homework Assignment 3 Handed Out: Feb 10 Due: Feb 17 1. (20 pts) Consider the leftist heap shown below. (a) Show the new heap that results when a deleteMin is performed. Show the inter-mediate steps. (b) To the heap that you got after the deleteMin, insert a new key ’7’. Show the new heap after the insertion. Show the intermediate steps. 8 18 24 37 33 20 5
This is the end of the preview.
access the rest of the document.