Rolfe cites two main advantages: "in circumstances in which one generates an entire binary search tree at the beginning of processing, followed by item look-up access for the rest of processing" and "pedagogically within a course on data structures where one progresses from the binary search tree into self-adjusting trees, since it gives a first exposure to doing rotations within a binary search tree."
Rolfe citira dve glavne prednosti: "u okolnostima koje generisu celo binarno stablo na početku obrade, praćeno pronalaženjem pristupa za ostatak obrade" i "pedagogški u procesu data strukture gde jedan napreduje iz binarne pretrage stabla u samopodešavajuće stablo, pošto daje prvo izlaganje za rotacije unutar binarne pretrage stabla".