Question: * * if ( temp < heap [ child ] ) { heap [ i ] = heap [ child ] ; } else break;

** if(temp < heap[child]){ heap[i]= heap[child]; }else break; i = child; } heap[i]= temp; } private int maxChild(int i){ int leftChild = kthChild(i,1); int rightChild = kthChild(i,2); return heap[leftChild]>heap[rightChild]?leftChild:rightChild; **
The Ternary operation shown above is from the method shown below, please help convert this ternary operation into a if and else statement. I Have been stuck on this for a few days know on how to do this, with out destroying the logic, that then breaks my code.
private void heapifyDown(int i){
int child;
int temp = heap[i];
while(kthChild(i,1)< heapSize){
child = maxChild(i);
if(temp < heap[child]){ heap[i]= heap[child]; }else break; i = child; } heap[i]= temp; } private int maxChild(int i){ int leftChild = kthChild(i,1); int rightChild = kthChild(i,2); return heap[leftChild]>heap[rightChild]?leftChild:rightChild;
}

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:

// BinaryHeap_HW4.h // KV, May 2018, after Weiss, Data Structures textbook // KV: version for HW4; counts comps for insert and deleteMin; #ifndef BINARYHEAP_H_ #define BINARYHEAP_H_ #include #include...

Q:

A priority queue is a special kind of queue that does not dequeue items in FIFO order. Instead, items may be enqueued in any order, but are always dequeued in priority order. For example, if you...

Q:

#include #include #include using namespace std; class Student{ char name[45]; int priority; }; class BinaryHeap { private: vector heap; int left(int parent); int right(int parent); void heapifup(int...

Q:

********IN JAVA********** The problem is to convert the given Max Heap into a binary search tree (BST) with the condition that the final BST needs to be also a complete binary tree. Note We assume...

Q:

The heap presented in the text is also known as a max-heap, in which each node is greater than or equal to any of its children. A min-heap is a heap in which each node is less than or equal to any of...

Q:

Revise Heap in Listing 23.9, using a generic parameter and a Comparator for comparing objects. Define a new constructor with a Comparator as its argument as follows:Heap(Comparator comparator)...

Q:

-modify the code below -create a menu with functions that modify current code -Add function has to check for valid phone number input, date inputted cannot be a date that has not already happened...

Q:

Java: In this assignment we will create a sorting program that provides the user with a large assortment of sorting methods and options. The user should be able to choose from a menu to select which...

Q:

import java.io.*; import java.util.*; // for Stack class //////////////////////////////////////////////////////////////// class Node { public int iData; // data item (key) public double dData; //...

Q:

Start with the tree.java program and modify it to create a binary tree from a string of letters (like A, B, and so on) entered by the user. Each letter will be displayed in its own node. Construct...

Q:

If Apple Computer decided to issue additional common stock and Varga purchased 100 shares of this stock from Smyth Barry, the underwriter, would this transaction be a primary or a secondary market...

Q:

Suppose that X has a normal distribution such that Pr(X

Q:

Select all that apply Identify the statements that would be considered idea growers. ( Check all that apply. ) Multiple select question. You may be right, but should we take our chances? Who else...

Q:

Product Period DM DL MOH S&A Sales commissions No Yes # " Property taxes on factory building " Sales manager's salary " O IDM IDL Other Time left 1:38:48 9 No = Indirect materials used 0 0 Factory...