why new elements are added in bottom in heap tree

🏗 Why new elements go at the bottom of the heap

Think of a heap as a complete binary tree:

1. Complete binary tree rule:

   • Every level is fully filled except maybe the last one.
   • The last level fills from left to right.

2. So when we add a new element:

   • We always put it in the first empty spot at the bottom.
   • Why? To keep the tree complete.
   • This way, the heap stays a proper tree, which is required for heap operations to work correctly.

🔄 Then we fix the heap

After putting the element at the bottom:

• It might break the heap property (parent ≥ children for max-heap).
• So we bubble it up until it reaches the right spot.

🧠 Simple analogy:

Imagine a pyramid of boxes:

        8
      /   \
     5     7
    / \   /
   3  4  6

• New box = 10
• You can’t just put it on top, because it would break the pyramid structure.
• So you put it at the first empty spot at the bottom → then let it climb up until the pyramid rules are satisfied.

✅ Key points:

1. Always bottom first → keeps the heap complete.
2. Bubble up → restores heap order.
3. This combination ensures fast O(log n) insert and easy access to top element.