Unlike a self-balancing binary search tree, it does not do this incrementally during each operation, but periodically, so that its cost can be amortized over many operations.
Za razliku od samobalansirajućeg binarnog stabla, ovo ne radi postepeno posle svake operacije, već periodično, tako da cena moze biti amortizovana preko više operacija.