2 17 a. After second time deletion is N, 19, N, 17, 3, 25, 2, 7 Ob. After second time deletion is 36, 17, 3, 2, 5, 1, 2, 7 Oc. After third time deletion is 19, 17, 7, 1, 3, 2 Od. After second time deletion is 100, 19, 36, 17, 3, N, N, 2, 7 Oe. After third time deletion is 100, 36, 25, 19, 17, 7, 3, 2, 1 Of. After third time deletion is N, 19, N, 17, 3, N, 2, 7 Og. After second time deletion is 25, 19, 1, 17, 3, 2,7 Oh. After first time deletion is 36, 19, 25, 17, 3, 7, 1, 2 Oi. After first time deletion is 100, 19, 36, 17, 3, 25, N, 2, 7 Oj. After first time deletion is 100, 19, 36, 17, 3, 25, 1 Ok. After third time deletion is 100, 19, 36, 17, 3, 25 OI. After first time deletion is N, 19, 36, 17, 3, 25, 2, 7 Om. After second time deletion is 25, 19, 7, 17, 3, 2, 1 On. After third time deletion is 17, 3, 25, 1, 2, 7 Oo. After first time deletion is 100, 19, 36, 17, 3, 25, 2, 7 19 7 3 (100) 25 36 1
2 17 a. After second time deletion is N, 19, N, 17, 3, 25, 2, 7 Ob. After second time deletion is 36, 17, 3, 2, 5, 1, 2, 7 Oc. After third time deletion is 19, 17, 7, 1, 3, 2 Od. After second time deletion is 100, 19, 36, 17, 3, N, N, 2, 7 Oe. After third time deletion is 100, 36, 25, 19, 17, 7, 3, 2, 1 Of. After third time deletion is N, 19, N, 17, 3, N, 2, 7 Og. After second time deletion is 25, 19, 1, 17, 3, 2,7 Oh. After first time deletion is 36, 19, 25, 17, 3, 7, 1, 2 Oi. After first time deletion is 100, 19, 36, 17, 3, 25, N, 2, 7 Oj. After first time deletion is 100, 19, 36, 17, 3, 25, 1 Ok. After third time deletion is 100, 19, 36, 17, 3, 25 OI. After first time deletion is N, 19, 36, 17, 3, 25, 2, 7 Om. After second time deletion is 25, 19, 7, 17, 3, 2, 1 On. After third time deletion is 17, 3, 25, 1, 2, 7 Oo. After first time deletion is 100, 19, 36, 17, 3, 25, 2, 7 19 7 3 (100) 25 36 1
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
Related questions
Question
A maxHeap as follows, if it will be executed 3 times deletion. The following description about the storing Array for this maxHeap is right?
(Multiple choice) (without loss of generality, Array is arranged from left to right as A[1]~A[n], and N means NULL, no value)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education