In this Python Programming video tutorial you will learn about heapq module and priority queue in detail.

Data structure is a way of storing and organising the data so that it can be accessed effectively.
Tree is a non linear data structure contains group of nodes connected via links or edge.

Binary heap is a complete binary tree with heap property.

heapq.nsmallest(n,iterable,key=None)is equal to sorted(iterable,key=key)[:n]

#python #data-science