Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...

Question

Question

Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...

Given the following array of integers (of capacity 20) with 12 items:

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

8

4

10

15

5

7

11

3

9

13

1

6

Index of last element = 11

Does this array represent a min heap? If not, convert it to a min heap (i.e., “heapify” it). Please show all steps.

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Answer)
The original array given is like:

8,4,10,15,5,7,11,3,9,13,1,6

The index of the last element is 11.

The array does not represent the min heap since the minimum element is not at the top.

We can convert the above array to the min heap to the below array:

1,3,6,5,4,7,11,15,9,13,8,10

We can build the min heap tree by converting the tree into min heap:

ano1 003 DOG 000片 D004 D007 11 015 2009 013 0008 如们

**Please Hit Like if you appreciate my answer. For further doubts on the or answer please drop a comment, I'll be happy to help. Thanks for posting.**

Add a comment

Answer 2

Similar Homework Help Questions

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers ke...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...
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.
You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4] [5] [6] [7] 6 9 17 29 33 41 58 61 [8] [9] [10] [11] [12] [13] 67 87 93 112 118 145 We want to find 12 in the given array, using binary search algorithm. The first comparison will be made with ----- 6 58 61 None. 12 is not in the array.

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60,...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...
Write a C++ function, smallestIndex, that takes as parameters an int array and its size and...

Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. The program should print out Enter 15 integers: The position of the first occurrence of the smallest element in...
Write a program that asks the user to input 10 integers of an array. The program...

Write a program that asks the user to input 10 integers of an array. The program then inserts a new value at position (or index) given by the user, shifting each element right and dropping off the last element. For example, in the sample input/output below, the program will insert the value 30 at index 3. All the previous numbers of the array starting from position 3 (i.e., 7 1 20 9 23 8 22 will be shifted one position...

Please write in C# Write a method in C# int[]GetDuplicatesIndices(int[]array), which takes an array of integers...

Please write in C# Write a method in C# int[]GetDuplicatesIndices(int[]array), which takes an array of integers and returns an array that holds the indices of all the duplicates. Example if the array has the following value 10, 5, 3, 7, 5, 11, 15, 13, 11, 6, 3, 19 then note that the value 5 has duplicate at index 4, value 3 has a duplicate at index 11, and value 7 has a duplicate at index 6. So the method should...
PROGRAM DESCRIPTION Using the given class definitions for either C++, create a minimum heap that stores...

PROGRAM DESCRIPTION Using the given class definitions for either C++, create a minimum heap that stores integers and and implements a minimum priority queue. (Your program can be "hard coded" for integers - it does not need to use templates, generics, or polymorphism.) Your data structure must always store its internal data as a heap. Your toString function should return a string with the heap values as a comma separated list, also including the size of the heap as well....
Python DESCRIPTION Write a program that will read an array of integers from a file and...

Python DESCRIPTION Write a program that will read an array of integers from a file and do the following: ● Task 1: Revert the array in N/2 complexity time (i.e., number of steps) . ● Task 2: Find the maximum and minimum element of the array. INPUT OUTPUT Read the array of integers from a file named “ inputHW1.txt ”. To do this, you can use code snippet from the “ file.py ” file. This file is provided in Canvas....

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...

Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...

Homework Answers

Add Answer to:
Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...

Post as a guest

Earn Coins

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers ke...

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

You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60,...

Write a C++ function, smallestIndex, that takes as parameters an int array and its size and...

Write a program that asks the user to input 10 integers of an array. The program...

Please write in C# Write a method in C# int[]GetDuplicatesIndices(int[]array), which takes an array of integers...

PROGRAM DESCRIPTION Using the given class definitions for either C++, create a minimum heap that stores...

Python DESCRIPTION Write a program that will read an array of integers from a file and...

This question is about the min-heap. A min-heap with 10 elements is given in the following...

Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...

Homework Answers

Add Answer to: Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...

Post as a guest

Earn Coins

Add Answer to:
Given the following array of integers (of capacity 20) with 12 items: 0 1 2 3...