Heap in Python

A data structure that stores data in a binary tree structure
 

A collection of data elements stored in an unordered manner
 

A stack data structure with additional constraints
 

A sorted collection of data elements
 

heap = []
 

heap = [1, 2, 3, 4]
 

from heapq import heapify; heapify([1, 2, 3, 4])
 

heap = {1: 'a', 2: 'b', 3: 'c'}
 

O(log n)
 

O(n)
 

O(1)
 

O(n log n)
 

heap.append(5)
 

heap.insert(5)
 

from heapq import heappush; heappush(heap, 5)
 

heap.add(5)
 

O(log n)
 

O(n)
 

O(1)
 

O(n log n)
 

heap.pop()

 

heap.remove(0)
 

from heapq import heappop; heappop(heap)
 

heap.delete_min()
 

O(log n)
 

O(n)
 

O(1)
 

O(n log n)

heap[0]
 

min(heap)

from heapq import heappush; heappush(heap, 5)

heap.peek()
 

heap[0]
 

peek_heap(heap)
 

heap_peak(heap)
 

heappop(heap)
 

Faster insertion and removal of elements
 

Faster searching of elements
 

Requires less memory
 

None of the above