This implementation exploits features of machine instruction sets that can make heap operations even faster.

Suppose an item's index is 5. Then the index of its left child is 10 and that of its right child is 11. In binary: