Max-Heap
Domain: Data Structures
🎯 Motivation
A heap where the parent is always greater than or equal to its children. The maximum value sits at the root.
📋 Concrete Example
Array [100, 50, 80, 30, 40]: 100 at root, children 50 and 80, grandchildren 30 and 40. Every parent beats its children.
🔗 Analogy
A leaderboard where the highest scorer is always displayed at the top. When a new high score comes in, it bubbles up to the top.