Aragon and Seidel also suggest assigning higher priorities to frequently accessed nodes, for instance by a process that, on each access, chooses a random number and replaces the priority of the node with that number if it is higher than the previous priority.
Aragon i Seidel takođe sugerišu na dodeljivanje većih prioriteta na češće pristupne čvorove, na primer procesom koji, na svakom pristupu stablu, izabere slučajan broj pa zameni prioritet čvora tim brojem, ako mu je prioritet veći od prethodnog.