Python: Push three items into a heap and return the smallest item from the heap
Python heap queue algorithm: Exercise-22 with Solution
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.
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("The smallest item in the heap:")
print(heap[0])
print("----------------------")
print("Pop the smallest item in the heap:")
heapq.heappop(heap)
for a in heap:
print(a)
Sample Output:
Items in the heap: ('V', 1) ('V', 3) ('V', 2) ---------------------- The smallest item in the heap: ('V', 1) ---------------------- Pop the smallest item in the heap: ('V', 2) ('V', 3)
Flowchart:

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 the heap and print the items from the heap.
Next: Write a Python program to push an item on the heap, then pop and return the smallest item from the heap.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join