The question is intended as a self-test for readers. Answers may be found in Appendix C.
Finding a node in a binary search tree involves going from node to node, asking
a. how big the node’s key is in relation to the search key.
b. how big the node’s key is compared to its right or left children.
c. what leaf node we want to reach.
d. what level we are on.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.