USA: +1 (725) 712-1730 
Sign in
If the base case of a recursive function returns a value It would be unusual since recursive functions usually don’t return anything. The value returned will always be 0. Then every recursive case must also return a value Then the function is done with its work The ordering of nodes in a binary search tree follows the rule: Items less than or equal to the root go to the left, otherwise they go to the right. Everything but the root is on the left. The most important things go at the top. Items that come first go at the bottom.
Expert Answer
9. Then every recursive case must return a value.
As you can see first case 1st two options are not valid because we know most of the time recursive functions do return a value, and most of the time their value is not zero, it depends on the use.
and option d is true only with tail recursion, where the last operation is recursion call
10 Items less than or equal to the root goes to the left. others go to the right (this is the defination of binary tree)
