Heap

C++

Java

Python3

include

#include <queue>

import java.util.*;

from queue import PriorityQueue

new min heap

std::priority_queue<int, std::vector<int>, std::greater<int>> h;

Queue<Integer> h = new PriorityQueue<>();

h = PriorityQueue()

new max heap

std::priority_queue<int> h;

Queue<Integer> h = new PriorityQueue<>(Collections.reverseOrder());

push

h.push(i);

h.add(i);

h.put((1, "Harry"))

pop

h.pop();

Integer popped = h.poll();

popped = h.get()

top

h.top()

h.peek()

popped = h.get()
h.put(popped)

size

h.size()

h.size()

h.qsize()

check empty

if (h.empty())

if (h.isEmpty())

if h.empty():