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

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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Insert the following elements in sequence into an empty binary max heap: 1, 6, 4, 7, 2, 8, 9, 10 Draw the tree representation of the heap after every insertion.
Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38 45 15 18 20 21 b) Write the heap out as a binary tree. 0 1 2 3 4 5 7 8 9 10 11 91 c) Add last 2 digit of your arid no(Take 7 and B- 18 27 10 45 83 91 31 12 52 51 2). to the heap, making sure to restore the 1 2 3 4 5 7. 6. 10 11 C. 1 13 20 21 65 54 67 41 30 83 52 heap invariant. How does the array look now?
Q.No.3 Which array out of A, B and C represents a binary heap? Only one answer is right. Write the heap out as a binary tree. Add last 2 digit of your Roll no suppose your roll no is(47). to the heap, making sure to restore the heap invariant. How does the array look now?
Question Give the sequence of the 13 keys in the array that results after inserting the sequence of 3 keys 75 31 40 into the following maximum-oriented binary heap of size 10: 93 82 77 16 59 20 69 11 13 41 Answer Your answer should be a sequence of 13 integers, separated by whitespace.
30. In the implementation for a breadth-first search we studied, a queue was used. The code below replaces the queue with a stack. List the pre-order enumeration that the vertices in the graph below are visited using this modified method, starting from vertex 0. } 3 /** stack-based search */ static void modSearch (Graph G, int start) { Stack S new AStack (G.n()); S.push(start); } 6 G.setMark (start, VISITED); while (S.length) > 0) { } modSearch: intv S.pop(); PreVisit (G, v); for (int w = G.first (v); w < G.n(); w = G.next(v, w)) if (G.getMark (w) == UNVISITED) { G.setMark (w, VISITED); S.push(w);
Q.No.3 a) Which array out of A, B and C represents a 01 2 8 9 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38|45| 15 18 20 21 3 4 $ 6 7 8 9 1011 b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no. to the heap, B- 18 27 10 45 83 91 31 12 52 51 2 4 5 7 8 9 10 11 making sure to restore the heap invariant. C: 1 13 20 21 65 54 67 41 30 83 52 How does the array look now?
1. Make a complete binary tree of the following list. Then heapify the tree to min heap. 7 18 6 9 25 4 13 32 20 1
There is an algorithm for making the heap complete:1. Remove the node at the root.2. Move the node in the last position to the root.3. Trickle the last node down until it is below.When this algorithm is applied continually, the data is removed from theheap in sorted order. imlement the code for the Remove and TrickleDownmethods:
Suppose we have an ArrayHeap that uses the array representation from class (also called "tree representation 3B" in lecture). Recall that in this representation that the leftmost item is unused. Consider a heap with the following underlying array: -8 -2 9. 1 10 10 12 Suppose we perform an in-order traversal of the heap represented by this array. What will be the last value in the in-order traversal? O -8 O 5 O-2 O 9 O 8 O 1 O 10 O 12