Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Which of the following list(s) is (are) not max-heap based on MaxHeapify algorithm? Left(i) return i*2 Right(i) return i*2 + 1 MaxHeapify(int[] A, int i){

  1. Which of the following list(s) is (are) not max-heap based on MaxHeapify algorithm?

Left(i)

return i*2

Right(i)

return i*2 + 1

MaxHeapify(int[] A, int i){

l = Left(i);

r = Right(i);

largest = Integer.MIN_VALUE;

if((l A[i]))

largest = l;

else

largest = i;

if((r A[largest]))

largest = r;

if (largest != i){

swap A[largest] with A[i]

maxHeapify(A, largest);

}

}

which one is right ???

A = {23, 17, 14, 16, 12, 10, 13, 11, 15} A = {56, 45, 20, 44, 30, 10, 15, 39, 40} A = {56, 23, 50, 20, 18, 45, 49, 19, 17} A = {58, 30, 48, 25, 18, 45, 49, 19, 17} None of the above

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

DB2 Universal Database V7.1 Application Development Certification Guide

Authors: Steve Sanyal, David Martineau, Kevin Gashyna, Michael Kyprianou

1st Edition

0130913677, 978-0130913678

More Books

Students also viewed these Databases questions

Question

It can be physically harmful.

Answered: 1 week ago