What do I use for a max-heap implementation in Python?

Question

Python includes the heapq module for min-heaps, but I need a max heap. What should I use for a max-heap implementation in Python?

Answer 1

The max-heap can be used for as follows:-

import heapq 

listForTree = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]

heapq.heapify(listForTree) 

heapq._heapify_max(listForTree) 

If you then want to pop elements, use:

heapq.heappop(minheap) 

heapq._heappop_max(maxheap)