Heap Operations

Consequence of ordering property: every path is ordered.

Insertion: new value must go in the bottom level as far to the left as possible - to preserve structural property.

Ordering property might be violated: repair with sift up operation.

Sift Up: move the value up the tree by exchanging it with its parent if they are in the wrong order.

Insert 29