A. Construct a heap for the list ( 2, 5, 6, 4, 3, 1, 8, 7...

Question

Question

A. Construct a heap for the list ( 2, 5, 6, 4, 3, 1, 8, 7 ) by the bottom-up algorithm

B. Construct a heap for the list ( 2, 5, 6, 4, 3, 1, 8, 7 ) by successive key imsertions (top-down algorithm)

C. Is is true that the bottom-up and top-dowj alogorthms yield the same heap for the same input?

engineering Computer-Science

Answer 1

Answer #1

A.

B.

C. As can be seen from the above example bottom-up and top-down algorithms do not yield the same heaps for same inputs.

Answer 2

Similar Homework Help Questions

1. Let A = {a1, ..., an} and B = {b1, ..., bm} be two sets...

1. Let A = {a1, ..., an} and B = {b1, ..., bm} be two sets of numbers. Consider the problem of finding their intersection, i.e., the set C of all the numbers that are in both A and B. a. Design a presorting based algorithm for solving this problem and determine its efficiency class. 2. Estimate how many searches will be needed to justify time spent on presorting an array of 103 elements if sorting is done by mergesort...
Consider the following max-heap: i 0 1 2 3 4 5 6 7 8 pq[i] -...

Consider the following max-heap: i 0 1 2 3 4 5 6 7 8 pq[i] - 30 18 28 17 6 20 2 9 Show the resulting heap as array after performing delmax().
Consider the following max-heap stored as an array: <7, 6, 4, 2, 5, 1, 3>. Draw...

Consider the following max-heap stored as an array: <7, 6, 4, 2, 5, 1, 3>. Draw this max-heap as an (undirected) binary tree and give both adjacency-list representation and adjacency-matrix representation of the binary tree

You are given an input array of integers: [8, 3, 7, 1, 2, 10, 5]. (a)...

You are given an input array of integers: [8, 3, 7, 1, 2, 10, 5]. (a) Build a min-heap for the input data. Draw a figure just to show the min-heap. (b) Using the min-heap built above, sort the input data in non-descending order using the heap sort algorithm.
This question is about the min-heap. A min-heap with 10 elements is given in the following...

This question is about the min-heap. A min-heap with 10 elements is given in the following array format. The following three sub-questions all refer to this min-heap i 1 2 3 4 5 6 7 8 9 10 A[i] 11 22 33 44 55 66 77 88 99 100 Show the result after applying heap-decrease-key(A, 6, 12) to the min-heap at the top of this page: i 1 2 3 4 5 6 7 8 9 10 A[i] Show the...
Insert the keys 7, 6, 2, 13, 4, 6, 5, 12 into a min-heap once a...

Insert the keys 7, 6, 2, 13, 4, 6, 5, 12 into a min-heap once a time, then remove the key in the root repeatedly until the heap is empty. Use diagrams to illustrate each step of the insertion and deletion procedure. What is the time complexity of sorting in this fashion?

Algorithm Illustrate the HeapSort on the following array. [ 7, 2, 4, 6, 3, 1, 5...

Algorithm Illustrate the HeapSort on the following array. [ 7, 2, 4, 6, 3, 1, 5 ] Show the array and the heap after each call to ReHeap.
braw the binary min heap that results from inserting 8, 7, 3, 2, 4, 6, 9,...

braw the binary min heap that results from inserting 8, 7, 3, 2, 4, 6, 9, 5, 1 in that order into an initially empty binary min hea p. Show final tree and the array representation of the heap. No need to show the intermediate work. 0 5 6 8 10 12 9. Consi der the binary heap shown below. What would the heap look like after deleteMin operation is performed? Show your work. 13 28 44 61 60 68...
A max-heap with 10 elements is given in the following array format. The following three sub-questions...

A max-heap with 10 elements is given in the following array format. The following three sub-questions all refer to this max heap. i 1 2 3 4 5 6 7 8 9 10 A[i] 99 90 80 70 60 50 40 30 20 10 Show the result after applying heap-increase-key(A, 9, 95) to the max-heap at the top of this page: i 1 2 3 4 5 6 7 8 9 10 A[i] Show the result after applying heap-extract-max(A) to...

Discrete Mathematics Time Complexity Analysis Due: May 9th, 2019 Math 4 6026 Heap Sort Another algorithm for sorting uses a specialized tree structure called a "heap." Specifically, we wi...

Discrete Mathematics Time Complexity Analysis Due: May 9th, 2019 Math 4 6026 Heap Sort Another algorithm for sorting uses a specialized tree structure called a "heap." Specifically, we will use a binary heap, which is like a binary tree with hierarchy. Here is an example of a binary heap structure 1. 2. There is a top vertex, called the parent vertex (aka node). The top parent vertex connects to two vertices a level below. These vertices are the "left child"...