max heap data structure

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()+" "); } } }

priority queue max heap in java

//Sol1
PriorityQueue<Integer> queue = new PriorityQueue<>(10, Collections.reverseOrder());


//Sol2
// PriorityQueue<Integer> pq = new PriorityQueue<>((x, y) -> y - x);
PriorityQueue<Integer> pq =new PriorityQueue<>((x, y) -> Integer.compare(y, x));


//Sol3
PriorityQueue<Integer> pq = new PriorityQueue<Integer>(defaultSize, new Comparator<Integer>() {
    public int compare(Integer lhs, Integer rhs) {
        if (lhs < rhs) return +1;
        if (lhs.equals(rhs)) return 0;
        return -1;
    }
});

Posted by: Guest on September-22-2020

Source

Code answers related to "max heap data structure"

Code answers related to "Java"

Browse Popular Code Answers by Language

Answers for "max heap data structure"

Code answers related to "max heap data structure"

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