max heap gfg

import java.util.PriorityQueue; public class MaxHeapWithPriorityQueue { public static void main(String args[]) { // create priority queue PriorityQueue<Integer> prq = new PriorityQueue<>(Comparator.reverseOrder()); // insert values in the queue prq.add(6); prq.add(9); prq.add(5); prq.add(64); prq.add(6); //print values while (!prq.isEmpty()) { System.out.print(prq.poll()+" "); } } }

// C++ program to show that priority_queue is by // default a Max Heap #include <bits/stdc++.h> using namespace std; // Driver code int main () { // Creates a max heap priority_queue <int> pq; pq.push(5); pq.push(1); pq.push(10); pq.push(30); pq.push(20); // One by one extract items from max heap while (pq.empty() == false) { cout << pq.top() << " "; pq.pop(); } return 0; }

min max heap java

// min heap: PriorityQueue implementation from the JDK
PriorityQueue<Integer> prq = new PriorityQueue<>();

// max heap: PriorityQueue implementation WITH CUSTOM COMPARATOR PASSED
// Method 1: Using Collections (recommended)
PriorityQueue<Integer> prq = new PriorityQueue<>(Collections.reverseOrder());
// Method 2: Using Lambda function (may cause Integer Overflow)
PriorityQueue<Integer> prq = new PriorityQueue<>((a, b) -> b - a);

Posted by: Guest on December-04-2020

Code answers related to "max heap gfg"

Code answers related to "Java"

Browse Popular Code Answers by Language

Answers for "max heap gfg"

Code answers related to "max heap gfg"

Code answers related to "Java"

Java Answers by Framework

Browse Popular Code Answers by Language

Popular Programming Languages

Advertisements

Company

Compilers

Help

Connect with us