Consider the following sequence of integers: 6, 12, 4, 2, 1, 8, 16, 5 a) Using ASCII art, draw the result of inserting these integers in this order into a min-heap. i) ASCII art example: A / \ B C / D b) Write the array representation of this heap: c) Redraw the heap after the smallest element is removed. d) Is the resulting binary tree: i) Complete? ii) Full?

1. a)Show the result of inserting the following values one at a time into an initially empty binary heap. (Show the heap after each insert). Use trees to illustrate each heap. 42, 11, 28, 8, 13, 61, 18 b) Show how the final heap created in the previous problem would be stored in an array.

17) Map Implementation Homework • Unanswered А map. Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation. SHOW MORE V a can be implemented with an array b can be implemented with a hash table can be implemented with a queue has widely variable performance based on its underlying storage structure must be colorable in four colors or less

4. Insert the following integer keys into a binomial-heap. Show the steps and binomial-heap after each insertion. 40, 90, 20, 70, 50, 60, 30, 10, 80

Copy A-D to your Solution file and remember to answer all questions A. Write your name. B. Write code oriented pseudo-code or a C++ function that given a binary tree of heaps, deletes an element form each heap and places it into a dynamically allocated array based on the right-left-root order of the binary tree. Assume the following: · Each node in the binary tree has a pointer to a heap object. · Each heap contains at least one element, a pointer to a Data object. The last element in the array is to be a sentinel value that will be set to NULL. • To complete this task call heap ADT functions. C. Give an example that could be used to test this algorithm. Show what is given and what is returned. D. List any assumptions used in your design.

We are given a recurrence of T(n) = T(n-1) + (n). For this recurrence it must be proven that T(n) is Ⓒ (n^2).