Using Java’s Priority Queue as Min-Heap and Max-Heap
Introduction The Java util package provides a versatile data structure known as the PriorityQueue. This is essentially an implementation of a priority queue using a binary heap. By default, it works as a min-heap, but by passing a custom comparator, it can function as a max-heap. In this guide, we’ll explore the nuances of using […]
Using Java’s Priority Queue as Min-Heap and Max-Heap Read More »