The following exercises provide you with the opportunity to practice with treaps. The solutions to these exercises are found in the section .
Look at this shiny randomized treap:

What will the treap look like after inserting a node with the value "L" and the priority 100?
What will the previous treap look like if the "L" node we’re inserting has a priority of 5 (rather than the 100 from the previous exercise)?
What will the previous treap (had you not done the insertion of the previous exercises) look like if we delete the "Q" node?