Skip to main content

Max Heap

Learn Max Heap (Heap, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

The Mirror of Min-Heap Every node is ≥ both its children - the LARGEST element sits at the root. Java's PriorityQueue is min-heap by default, so a max-heap needs a Comparator flipping the order.

More lessons in Heap