Question: 1 . Let index = length / 2 - 1 . This is the parent of the last node in the tree, i . e

1.Let index = length/2-1. This is the parent of the last node in the tree, i.e. list[index +1]... list[length-1] are leaves
2.Convert the subtree with root of list[index] into a heap.
a.Given list[a] is root of tree, list[b] is left child (root *2+1), list[c] is right child (root*2+2), if exists
b.Compare list[b] with list[c] to determine larger child, list[largerIndex]
c.Compare list[a] with list[largerIndex]. If list[a]< list[largerIndex], then swap, else already a heap
d.If swap, repeat step 2 for the subtree of list[largerIndex]
3.Convert the subtree with the root of list[index-1] into a heap, repeat until list[0]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

Need help with simulating Heap Sort on paper by filling in the following array and showing the items in a tree. Build Heap 1. Let index = length/2-1. This is the parent of the last node in the tree,...

Q:

Rewrite the ( quicksort) function as a descending order sort. Do not simply sort items in ascending orderand then reverse the order of the array elements. Write a program to test your function. below...

Q:

Write a function that finds the kth largest number in a vector of n numbers. Write functions similar to the build heap and heapify methods to find the kth largest number in the vector. The functions'...

Q:

Rewrite the heap sort function as a descending order sort. Do not simply sort items in ascending order and then reverse the order of the array elements. Write a program to test your function. DATA...

Q:

Heap Sort Build Heap 1. Let index length/2-1. This is the parent of the last node in the tree i.e. listindex 1]. Iist[length-1] are leaves 2. Convert the subtree with root of list index] into a heap...

Q:

I need help on this lab Im working on . Build Heap Let index = length/2-1. This is the parent of the last node in the tree, i.e. list[index + 1].. . list[length-1] are leaves Convert the subtree with...

Q:

Please hurry! Use the prompt below and the files provided to create sequence4.template. Thank you Node2.h Node2.template Sequence_exam4 Sequence4.h The purpose of this lab is to help reinforce...

Q:

Please use C++ language to answer the following question: Implement the following two functions to your heap structure: moveDown() - similar to remove() function, except that it doesnt remove node...

Q:

Problem Description The assignment is meant as an introduction to Java programming and is partially structured as a tutorial. To solve this assignment you will have to make use of concepts we havent...

Q:

// CS 0445 Spring 2019 // Read this class and its comments very carefully to make sure you implement // the class properly. The data and public methods in this class are identical // to those...

Q:

Growing companies often need capital to purchase or build additional facilities. There are many potential sources of such capital. Describe how an investor might use the statement of cash flows to...

Q:

Choose an organization, such as Apple Inc. or an insurance company, and then discuss the organizational features that spur or stifle innovation depending on the state you choose (10 features that...

Q:

Extrim Company produces monitors. Extrims plant in San Antonio uses a standard costing system. The standard costing system relies on direct labor hours to assign overhead costs to production. The...

Q:

Corporate strengths should be assessed relative to a firms competitors in order to understand customers and their a. demographics. b. awareness. c. market segments. d. purchase choices