Then, a balanced binary tree is built on the elementary intervals, and for each node v it is determined the interval Int(v) it represents.
Onda, balansirano binarno drvo se pravi na elementarnim intervalima i za svaki čvor v determinisan je interval Int(v) koji predstavlja.