Consider the PriorityQueue class in the answer box below, complete the percolate_down (self, index) method. The method takes an integer as a parameter. This method should keep comparing the element at the parameter index and swapping it with its smallest child if the heap property is violated. Note: • submit the entire class definition. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. • You can assume that the parameter index is within the valid range. • The elements are NOT in heap order property in this question for testing purpose. For example: Test Result print (pq2) [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] pq2.percolate_down (5) [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] print (pq2) [0, 2, 7, 26, 3, 19, 17, 1, 90, 25, 36] pq2.percolate_down (4) [0, 2, 7, 1, 3, 19, 17, 26, 90, 25, 36] print (pq2) [0, 2, 3, 1, 7, 19, 17, 26, 90, 25, 36] pq2.percolate_down (3) [0, 1, 3, 2, 7, 19, 17, 26, 90, 25, 36] print (pq2) pq2.percolate_down (2) print (pq2) pq2.percolate_down (1) print (pq2)

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

+_

Consider the PriorityQueue class in the answer box below, complete the percolate_down (self, index) method.
The method takes an integer as a parameter. This method should keep comparing the element at the parameter index
and swapping it with its smallest child if the heap property is violated.
Note:
• submit the entire class definition. Keep a copy of your solution to this task because you will be extending it step by
step in subsequent tasks.
• You can assume that the parameter index is within the valid range.
• The elements are NOT in heap order property in this question for testing purpose.
For example:
Test
Result
[0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36]
26, 25, 19, 17, 1, 90, 3, 36]
[0, 2, 7, 26, 3, 19, 17, 1, 90, 25, 36]
[0, 2, 7, 1, 3, 19, 17, 26, 90, 25, 36]
[0, 2, 3, 1, 7, 19, 17, 26, 90, 25, 36]
[0, 1, 3, 2, 7, 19, 17, 26, 90, 25, 36]
print (pq2)
pq2.percolate_down (5) [0, 2, 7,
print (pq2)
pq2.percolate_down (4)
print (pq2)
pq2.percolate_down (3)
print (pq2)
pq2.percolate_down (2)
print (pq2)
pq2.percolate_down (1)
print (pq2)
Transcribed Image Text:Consider the PriorityQueue class in the answer box below, complete the percolate_down (self, index) method. The method takes an integer as a parameter. This method should keep comparing the element at the parameter index and swapping it with its smallest child if the heap property is violated. Note: • submit the entire class definition. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. • You can assume that the parameter index is within the valid range. • The elements are NOT in heap order property in this question for testing purpose. For example: Test Result [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] 26, 25, 19, 17, 1, 90, 3, 36] [0, 2, 7, 26, 3, 19, 17, 1, 90, 25, 36] [0, 2, 7, 1, 3, 19, 17, 26, 90, 25, 36] [0, 2, 3, 1, 7, 19, 17, 26, 90, 25, 36] [0, 1, 3, 2, 7, 19, 17, 26, 90, 25, 36] print (pq2) pq2.percolate_down (5) [0, 2, 7, print (pq2) pq2.percolate_down (4) print (pq2) pq2.percolate_down (3) print (pq2) pq2.percolate_down (2) print (pq2) pq2.percolate_down (1) print (pq2)
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Mergesort
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
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