Search for node with key x. Start with i as the root.
Running time in terms of height of tree? How does this compare to doing the same thing in a heap?
Easily extended to insert x if it is not found.
.
.
.
. . .
