a) Which array out of A, B and C represents a 0 1 4. 89 10 11 binary heap? Only one answer is right. 1 12 23 10 15 38 45 15 18 20 21 A b) Write the heap out as a binary tree. 0 1 21 6. 7. 10 11 c) Add last 2 digit of your arid no(Take 7 and B= 1 8 27 10 45 83 91 31 12 52 51 2). to the heap, making sure to restore the 21 4. in 7. 9. 10 11 C. 1 13 20 21 65 54 67 41 30 83 52 heap invariant. How does the array look now? 738

Q: Q.No.3 a) Which array out of A, B and C represents a 01 2 3 8 9 10 11 A. 1 12 23 10 15 38 45 15 18…

A:

Q: The following is a max-heap. After inserting a new node with key equal to 88, what will the array…

A:

Q: Assume the following list: 30, 45, 1, 26, 90, 5, 85, 35, 20, 41, 38, 72, 11, 33, 49 Using the…

A: 30, 45, 1, 26, 90, 5, 85, 35, 20, 41, 38, 72, 11, 33, 49Using the function buildHeap as given in…

Q: a) Which array out of A, B and C represents a 0 1 2 10 11 binary heap? Only one answer is right. 1…

A: a. The array B represents the binary heap. The array B can be represented using a binary heap. Array…

Q: 6. Show the resulting binary heap after performing DeleteMin: 6. DeleteMin() 8 10 16 11 20 30 12 15…

A: Below is the answer to above question. I hope this will be helpful for you...

Q: Look at the tree at the following, in what order are the numbers printed for an in-order traversal…

A: As per our guidelines we are suppose to answer one question, kindly repost other questions as…

Q: Heapsort   We will call heapsort on the array of size 11 with values  0, 2, 7, 6, 8, 3, 1, 4, 7,…

A: Heapsort is a sorting algorithm that is based on the heap data structure. The idea behind heapsort…

Q: void build (int[] elts, int N); // The "magic" build operation which constructs a heap in O(N) time…

A: the code is an given below  public class JavaMinHeap {    private final int[] HeapArray;    private…

Q: 01 2 3 4 s6789 10 11 A. 1 12 23 10 15 38 45| 15 18 20 21| a) Which array out of A, B and C…

A: MAX-HEAP: A maximum load is a double tree wherein all the parent hubs are more prominent than or…

Q: p) Let A = [5, 12, 15, 10, 20, 24, 46, 56, 64, 32), Answer the following questions (2 + 5).…

A: As per policy , I am allowed to do only one question. Please post other one separately. I am…

Q: 6. Draw the heap that results from adding the following integers (34 45 3 87 65 32 1 12 17).

A: Introduction: Heap sort is a comparison-based sorting algorithm that is based on the Binary Heap…

Q: Assuming that the array shown below represents a binary tree of nodes holding Integer objects,…

A: Binary Tree : Binary tree is the tree having at most 2 children of every tree. So, there are variant…

Q: Question a) Which array out of A, B and C represents 7 9 10 11 a binary heap? Only one answer is…

A: 1) Array B represents a Binary Heap. So the correct answer is B   2)min-heap property was…

Q: Java Code: How to implement logic for ParseIf, ParseFor, and ParseWhile where all of the Node data…

A: It takes careful handling while parsing and processing programming language features in Java, such…

Q: Q2: Draw depending on this Binary Heap which called R. 1. Can you find where is the last and the…

A: from heapq import heapify, heappush, heappopR = []heapify(R) heappush(R, 40)heappush(R,…

Q: 3 4 5 6 7 8 9 0 1 2 3 4 5 6 ***** from heapq import heappop, heapreplace, heapify from queue import…

A: The given code is an implementation of the "Merge k Sorted Lists" problem. It merges k sorted linked…

Q: Question 20 Consider the stack s: [33, 51, 4, 7], s.top: Selected Answer: b. 7 Answers: a. 4 b. 7 c.…

A: Stack  The last in, first out (LIFO) principle underlies the conceptual structure of a stack, which…

Q: Min Heap of Candy — Add and Remove

A: // Candy.java public class Candy implements Comparable<Candy>{     private double weight;…

Q: public class Maint static int max(int[] arr){ int index = 0; int max = arr[0]; } for(int i = 0; i <…

A: Answer: We can optimized code if find the max element using the binary search and return the index .…

Q: Complete the body of this function. You do not need to check the precondition. You may use the stack…

A: Stack:- Stack is a linear data structure which follows a particular order in which the operations…

Q: (Test perfect binary tree) A perfect binary tree is a complete binary tree with all levels fully…

A: Here's the code:

Q: Pop off the min value from the below heap. Which is the correct heap after the removal? 10 20 30 40…

A: Heap : is a special Tree-based data structure in which the tree is a complete binary tree.

Q: Assuming that the array shown below represents a binary tree of nodes holding Integer objects,…

A: A required tree will be: shown below:-

Q: Trace out the heap sort algorithm for the following list: {25, 44, 55, 99, 30, 37, 15, 10, 2, 4}.

A: Given Trace out the heap sort algorithm for the following list: {25, 44, 55, 99, 30, 37, 15, 10, 2,…

Q: You have to draw the heap; you can not show it as an array or vector. Data Elements: 22 5 16 4 8 51…

A: HEAP SORT I)Heap sort is a sorting technique for the contrast based on the data structure of Binary…

Q: 4. Someone gives you an array with n numbers and claims that it is not a max- heap. Design an…

A:

Q: (Test perfect binary tree) JAVA A perfect binary tree is a complete binary tree with all levels…

A: Given: (Test perfect binary tree) JAVA A perfect binary tree is a complete binary tree with all…

Q: heap sort the list L ={D, B, G, E, A, H, C, F}.Writa all the steps with pseudecode.

A: Introduction of heap sort: Heap sort is an in-place sorting algorithm that works by building a heap…

Q: Give the array that results immediately after completing the first phase of heapsort (heap…

A: Answer is

Q: first parameter is an array that contains all the elements that // will go into the heap; the second…

A: the code is an given below  public class JavaMinHeap {    private final int[] HeapArray;    private…

Q: I. TRUE OR FALSE. Write the word TRUE if the statement is true or FALSE if the statement is false.…

A: 5. Heapify is the procedure for maintaining the heap property when one of the elements of the heap…

Q: Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 8 9 10 11 binary heap? Only one…

A:

Q: 6. Draw the heap that results from adding the following integers (34 45 3 87 65 32 1 12 17). 87 17…

A: - We have to explain why we get the structure used in the solution as the structure of heap.

Q: Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 8 9 10 11 binary heap? Only one answer…

A: 0 1 2 3 4 5 6 7 8 9 10 11 1 8 27 10 45 83 91 31 12 52 51   where as the above mentioned array B…

Q: 3. 2. Write Java code that remove next sibling in a general tree for the linked implementation using…

A: GIVEN:

Q: Is the following array a heap? Why or why not? 10 14 16 20 18 31 22 21 24 41 37 40

A: Ans: As per the given array that it is a heap ,it is true .The array is…

Q: Before deletion from a stack one must check the condition..... Select one: a.Underflow b.Maximum…

A: Underflow means stack is empty. Underflow condition is checked when a deletion of element in stack.…

Q: Q.No.3 a) Which array out of A, B and C represents a 0 1 2 9 10 11 binary heap? Only one answer is…

A: Part(a) The elements are in min heap when the key value of the child is greater than the key value…

Q: Generate the driver file (main.cpp) where you perform the following tasks. Note that you cannot make…

A: Description: The following c++ program does all the required tasks. Notice that after delete 1, the…

Q: Build a heap from the following array. Show the heap after ???????() occurred at each node. ? = [3,…

A: given array [3, 5, 1, 6, 2, 0, 8, 11, 9]

Q: In class we turned normal arrays into heaps. We called this operation heapify. Given the following…

A: Here we have array . to convert the array in the heap we have two types of heap .  Max-heap :- In…