As a complete implicit k-d tree has one inner node less than grid cells, it is known in advance how many attributes need to be stored.
Kako potpuno implicitno k-d stablo ima za jedan manje unutrašnjih čvorova nego ćelija mreže, unapred se zna koliko atributa treba da se sačuva.