The question is intended as a self-test for readers. Answers may be found in Appendix C.
A binary tree is a search tree if
a. every non-leaf node has children whose key values are less than (or equal to) the parent.
b. every left child has a key less than the parent and every right child has a key greater than (or equal to) the parent.
c. in the path from the root to every leaf node, the key of each node is greater than (or equal to) the key of its parent.
d. a node can have a maximum of two children.
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.