1 1, Delete a node from the array
2 (this creates a "hole" and the tree is no longer "complete")
3
4 2. Replace the deletion node
5 with the "fartest right node" on the lowest level
6 of the Binary Tree
7 (This step makes the tree into a "complete binary tree")
8
9 3. Heapify (fix the heap):
10
11 if ( value in replacement node < its parent node )
12 Filter the replacement node UP the binary tree
13 else
14 Filter the replacement node DOWN the binary tree
15
16