For each non-leaf node n in a preferred path P, it has a non-preferred child c, which is the root of a new auxiliary tree.
Svaki čvor n koji nije list u poželjnoj stazi S ima neprioritetno dete c koji je koren novog pomoćnog stabla.