Expected Depth in a Random Treap

A treap stores $n$ keys with random priorities. The tree is simultaneously a BST on keys and a max-heap on priorities. Show that the expected depth of any node is $O(\log n)$ by proving it equals the expected number of "ancestors" — which relates to the same indicator variable trick used in quicksort.