Let i denote (the array position of) a particular node. On most implementations, the
left child of i is located at the node 2i which can be computed in one instruction (by
left shifting the binary representation of i by one position), while the right child is
located at the node 2i + 1 (which can be computed in one instruction too, if there is an
FMA (= Fused Multiply-Add) instruction in the instruction set). The parent of a node
can be found by computing the position