Level order of a binary search tree: 80 30 90 10 85 5 20 89 12.

If we search for key 15, what keys in the tree are compared for this search miss?

What about a search for key 100?