Skip Lists. incomplete treatment in the lecture notes

[1dropaflame]

For https://jeffe.cs.illinois.edu/teaching/algorithms/notes/03-treaps.pdf

1. I found the math proofs hard to follow. A clarifying sentence here and there in the algebra would have helped.
2. Are all the nodes equal?
3. what happens in the case when the searched for key is in an upper layer. Do we still descend below?
   Please see discussion here https://www.reddit.com/r/AskComputerScience/comments/1h6jg62/skip_lists_why_does_one_always_go_to_the_last/?utm_source=share&utm_medium=web3x&utm_name=web3xcss&utm_term=1&utm_content=share_button