//free\\ — Heapadjuster

You have a node at index i that is smaller than one of its children. The left and right subtrees below it are perfect heaps, but the current node is out of place.

In the world of data structures, the "Heap" is a quiet giant. It powers priority queues, schedules operating system tasks, and finds the shortest path in maps (Dijkstra’s algorithm). But the heap doesn't maintain its magical properties by itself. heapadjuster

Think of it like a manager in a corporate hierarchy. If a new, incompetent manager (a small number in a Max-Heap) is placed above two talented employees (larger numbers), the HeapAdjuster demotes the manager down the chain until the most talented person rises to the top. The most common form of the HeapAdjuster is the "sift-down" operation. Let's walk through a Max-Heap example. You have a node at index i that

If you have ever struggled with Heap Sort or wondered how a binary tree stays organized, understanding the HeapAdjuster is your "aha!" moment. A HeapAdjuster is a function that restores the heap property in a binary tree when it is violated at a specific node. It powers priority queues, schedules operating system tasks,

# Check if right child exists and is greater than current largest if right < n and arr[right] > arr[largest]: largest = right