If the root is located at index 1 instead of 0, the last node in each level is instead at index 2 l + 1 − 1 {\displaystyle 2^{l+1}-1} .
Ako je koren lociran na indeksu 1 umesto na 0, poslednji čvor svakog nivoa je usled toga na indeksu 2 l + 1 − 1 {\displaystyle 2^{l+1}-1} .