Max Heap

C++ vs Python vs Rust

C++ Rust (use std::collections::BinaryHeap) Python
Declaration 
                       
priority_queue<pair<key, value>> pq
max_heap
i32 
let mut max_heap: BinaryHeap<> = 
BinaryHeap::new();
Pair <i32, char> 
let mut max_heap:BinaryHeap<(i32, char)> = 
BinaryHeap::new();

min_heap
i32 
use std::cmp::Reverse;
let mut min_heap: BinaryHeap<Reverse<i32>> = 
BinaryHeap::new();
                        
                       
#Python does not provide built-in heap.
#But it provides heapq module for heap operations on list
import heapq

# Creating a Max Heap
max_heap = []
heapq.heapify(max_heap)  # Convert list into a max heap
push 
       
dq.push_back(x)
            
       
max_heap.push(x);
min_heap.push(Reverse(x));
            
       
self.dq.append(x)
Front, Back element 
dq.front()
dq.back()
            
heap.front()
dq.back()
            
self.dq[0]
self.dq[-1]
Pop, Top 
       
dq.pop_front()
dq.pop_back()
            
                   
pub fn pop(&mut self) -> Option
while let Some(top) = max_heap.pop() {
}
if let Some(Reverse(top)) = min_heap.pop(){

}
            
self.dq.pop()
self.dq.popleft()
Check empty !dq.empty() !dq.empty() bool(self.dq) != False
size dq.size() dq.len() len(self.dq)