w3resource

Python Exercise: Push an item on the heap, then pop and return the smallest item from the heap

Python heap queue algorithm: Exercise-23 with Solution

Write a Python program to push an item on the heap, then pop and return the smallest item from the heap.

Sample Solution:

Python Code:

import heapq
heap = []
heapq.heappush(heap, ('V', 3))
heapq.heappush(heap, ('V', 2))
heapq.heappush(heap, ('V', 1))
print("Items in the heap:")
for a in heap:
	print(a)
print("----------------------")
print("Using heappushpop push item on the heap and return the smallest item.")
heapq.heappushpop(heap, ('V', 6))
for a in heap:
	print(a)

Sample Output:

Items in the heap:
('V', 1)
('V', 3)
('V', 2)
----------------------
Using heappushpop push item on the heap and return the smallest item.
('V', 2)
('V', 3)
('V', 6)

Flowchart:

Python heap queue algorithm: Push an item on the heap, then pop and return the smallest item from the heap.

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:


Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to push three items into a heap and return the smallest item from the heap. Also Pop and return the smallest item from the heap.
Next: Write a Python program to create a heapsort, pushing all values onto a heap and then popping off the smallest values one at a time.

What is the difficulty level of this exercise?

Test your Python skills with w3resource's quiz

Python: Tips of the Day

Returns a flat list of all the keys in a flat dictionary

Example:

def tips_keys(flat_dict):
  return list(flat_dict.keys())

ages = {
  "Jack": 15,
  "Owen": 21,
  "Wyatt": 11,
}
print(tips_keys(ages))

Output:

['Jack', 'Owen', 'Wyatt']