Data Structures
Heaps:Priority in O(log n) Without Sorting the Whole Collection
A binary heap is a complete tree in an array that keeps the next-best element at the root. Min vs max, PriorityQueue in the JDK, and why you will hear Fibonacci heap without implementing one.
Read More