Question: (weight: 30%) Programming: Write a function that tests whether a binary tree is a binary search tree. 4. Note: in a binary search tree, for

(weight: 30%) Programming: Write a function that tests whether a binary tree is a binary search tree. 4. Note: in a binary search tree, for each node, the values of all nodes in the right subtree are greater than the node, and the values of all nodes in the left subtree are less than the node. For instance, the following tree is not a binary search tree, because 15 must be less than 10. 10 7 12 6 15 513
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
