Heap insertion is like adding a new toy to a big pile of toys where the biggest or smallest toy always stays on top, depending on the rules. When you add a new toy, you find the right spot for it so the pile still follows the rules, and sometimes you have to move other toys around to make room.