6.3-1 Using Figure 6.3 as a model, illustrate the operation of BUILD-MAX-HEAP on the array A = (5,3, 17, 10, 84, 19, 6, 22,9).

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
icon
Related questions
Question

use figure 6.3 to answer the question

A413 2 16 9 10 14 8 7
14
8
2
14
14
8
9
8
8
9
2 8
2
16
i(16
10
10,
10
16
(a)
1
6
10
10
10
8
14
8
8
8
Ø
o
14
10
10
10,
16
5
16
(b)
(d)
16
6
6
9
10
10
10
Figure 6.3 The operation of BUILD-MAX-HEAP, showing the data structure before the call to
MAX-HEAPIFY in line 3 of BUILD-MAX-HEAP. (a) A 10-element input array A and the bi-
nary tree it represents. The figure shows that the loop index i refers to node 5 before the call
MAX-HEAPIFY (4,i). (b) The data structure that results. The loop index i for the next iteration
refers to node 4. (c)-(e) Subsequent iterations of the for loop in BUILD-MAX-HEAP. Observe that
whenever MAX-HEAPIFY is called on a node, the two subtrees of that node are both max-heaps.
(f) The max-heap after BUILD-MAX-HEAP finishes.
Transcribed Image Text:A413 2 16 9 10 14 8 7 14 8 2 14 14 8 9 8 8 9 2 8 2 16 i(16 10 10, 10 16 (a) 1 6 10 10 10 8 14 8 8 8 Ø o 14 10 10 10, 16 5 16 (b) (d) 16 6 6 9 10 10 10 Figure 6.3 The operation of BUILD-MAX-HEAP, showing the data structure before the call to MAX-HEAPIFY in line 3 of BUILD-MAX-HEAP. (a) A 10-element input array A and the bi- nary tree it represents. The figure shows that the loop index i refers to node 5 before the call MAX-HEAPIFY (4,i). (b) The data structure that results. The loop index i for the next iteration refers to node 4. (c)-(e) Subsequent iterations of the for loop in BUILD-MAX-HEAP. Observe that whenever MAX-HEAPIFY is called on a node, the two subtrees of that node are both max-heaps. (f) The max-heap after BUILD-MAX-HEAP finishes.
6.3-1
Using Figure 6.3 as a model, illustrate the operation of BUILD-MAX-HEAP on the
array A = (5, 3, 17, 10, 84, 19, 6, 22, 9).
Transcribed Image Text:6.3-1 Using Figure 6.3 as a model, illustrate the operation of BUILD-MAX-HEAP on the array A = (5, 3, 17, 10, 84, 19, 6, 22, 9).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Heapsort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education