We can make treaps self-adjusting by using the number of accesses as a priorityand
Chapter 12, Problem 12.12(choose chapter or problem)
We can make treaps self-adjusting by using the number of accesses as a priorityand performing rotations as needed after each access. Compare this method withthe randomized strategy. Alternatively, generate a random number each time anitem X is accessed. If this number is smaller than Xs current priority, use it as Xsnew priority (performing the appropriate rotation).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer