Q.No.3012 3 4 56 7 8 9 10 11A. 1 12 23 10 15 38|45| 15 18 20 21a) Which array out of A, B and C represents abinary heap? Only one answer is right.39 10 11b) Write the heap out as a binary tree.B= 18 27 10 45 83 91 31 12 52 5101 2 3 45 6 7 8 9 10 1C: 1 13 20 21 65 54 67 41 30 83 52c) Add last 2 digit of your arid no (Take 4 and9). to the heap, making sure to restore theheap invariant. How does the array looknow?

Answered: Image /qna-images/answer/0cf3e8a3-0171-4de7-afd5-7b5668ac077c.jpg

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 20 21 01 2 3 4 5 67 8 9 10 11 B- 18 27 10 45 83 91 31 12 52 51 binary heap? Only one answer is right. b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no (Take 4 and 01 2 3 4 56789 10 11 c. 1 13 20 21 65 54 67 41 30 83 52 9). to the heap, making sure to restore the heap invariant. How does the array look now?

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 20 21 01 2 3 4 5 67 8 9 10 11 B- 18 27 10 45 83 91 31 12 52 51 binary heap? Only one answer is right. b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no (Take 4 and 01 2 3 4 56789 10 11 c. 1 13 20 21 65 54 67 41 30 83 52 9). to the heap, making sure to restore the heap invariant. 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

Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 56 7 8 9 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 567 8 9 10 11 c) Add last 2 digit of your arid no(Take 7 and B= 18 27 10 45 | 83 91 31 12 52 51 0 1 2 3 8 9 10 11 2). to the heap, making sure to restore the C: 1 13 20 21 65 54 67 41 30 83 52 heap invariant. How does the array look now?
Q.No.3 0 1 2 9 10 11 3 a) Which array out of A, B and C represents a 4 A =|1 12 23 10| 15 38 45 15 18 20 21 binary heap? Only one answer is right. 0 1 2 8 9 10 11 3 4 6 7 b) Write the heap out as a binary tree. B=| 18 27 10| 45 83 91 31 12 52 51 c) Add last 2 digit of your arid nol 67). to the 0 1 2 3 8 9 10 11 4 6 heap, making sure to restore the heap C=|1 13 20 21 65 54 67 41 30 83 52 invariant. How does the array look now?
3. Draw the binary heap in its tree form from its array form: 0 1 2 3 4 5 6 7 8 9 10 11 12 2 3 4 9 10 17 15 11 9 13 22 20
6. Draw a Binary Tree from the following array data and sort the resulting tree using Heap sort algorithm. Index 1 2 3 4 5 7 8 9 10 11 12 13 Data 47 18 52 18 42 85 56 74 35 24 65 36 72
Java programming Help Need help with question: P 8.61 P 8.61: Implement the binary tree ADT using the array-based representation described in Section 8.3.2.
Given the array: 63 53 86 35 99 34 75 Heapify into a max-heap. Ex: 86, 75, 30
a) Which array out of A, B and C represents a OI 2 3 4 6 7 N 910 11 binary heap? Only one answer is right. A- 1 12 23 10 15 38 45 15 18 20 21 4 8 10 11 b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no. to the heap, 8- 18 27 10 45 83 91 31 12 52 51 12 3 4 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?
a) Which array out of A, B and C represents a 3 4 5 6 7 8 9 10 11 012 binary heap? Only one answer is right. A. 1 12 23 10 15 38 45 15 18 20 21 0 1 2 3 8 9 10 11 4 b) Write the heap out as a binary tree. B- 18 27 10 45 83 91 31 12 52 51 c) Add 59 to the heap, making sure to restore the heap invariant. How does the array look 2 3 4 5 6 7 8 9 10 11 c.1 13 20 21 65 54 67 41 30 83 52 now?
Q16. * In the following array representation of a Binary tree, the Left child of the node (D) is: 1 2 3 6 7 8 9 10 11 12 13 14 15 A F G H I J K L M N O 0 E F O G H OI 4 B C D 5 E
23 34 56 6 18 8910 urite lcode) the given mpeap abo above minhedp 3. 456 19 12 10 6 5 43 write Cco de) as a visuali 2ation of a tree, Tip :you may Use stringBullder CIuss and a program that prints the aboue max heap the String format () method ,Cuse Java) output Use 19 12 10 6. 4 3.
Array of tree : [25, 33, 35, 18, 22, 29, 55, 3, 1, 98] Change the tree into a max heap by showing how the contents of the array change step by step. Add a comment to explain what you are doing in each step.
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?