CSE 326, Spring 1995: Homework 9
Due Friday 6/2/95
(10 points) Consider the skew heap.
Design an iterative merge algorithm for the skew heap. Make your algorithm as elegant as possible.
Show the result of inserting 4,1,7,5,3,6,2 in that order into a skew heap.
Show the result after each of 4 successive delete_min operations on the following tree.
1 / \ 4 2 / \ / \ 5 7 3 6
(10 points) 6.15 a. b. and c. on page 248.