Heaps

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 »

Search

Algorithms Array Problems Arrays Binary Search Tree Coding Interview Collections Framework Comparable Interface Data Structure Data Structures Dictionary Doubly Linked List Fixed Length Sliding Window Functional Programming Graphs Hash Map HashMap Problems Hash Set HashSet Problems Heap Heap Problems Heaps Interview Preparation Java Java Generics Java Lambdas Java Streams Linked List Linked List Problems List Interface LRU Cache Map Interface Postorder Priority Queue Priority Queue Problems Python Queues Set Interface Sliding Window Sorting Algorithms Stack String Problems String to Integer Trees Tree Traversals Tries

Privacy Policy