Locally Fine Globally Broken
Every node below is on the correct side of its own parent: each left child is smaller than its parent, each right child is larger.
You call the standard BST lookup, the one that compares against the current node and descends left or right, once for each of the seven keys.
Which lookups return "not found"?
Sign in to answer questions and track your progress
Sign In