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

Python Data Structure: Exercise-8 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 Code Editor:

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.