📄️ constructor
PriorityQueue is an implementation of the binary heap data structure
📄️ insert
Insert an item into the heap
📄️ peek
Take a look at the root node of the heap
📄️ extract
Returns and remove the root node of the heap
📄️ sort
Returns a sorted list according to the rules of the comparator
📄️ is_empty
Checks if the binary heap is empty
📄️ search
Check if an item is present in the heap
📄️ update
Check if an item is present in the heap