(a) Find the minimum value of a binary search tree. (b) Given a binary search tree with distinct integer values, find the next consecutive integer in the tree using the structure of the tree and write the code in C++.
Sigiloso
(a) traverse all the way on the left, and (b), keep traversing upwards to the left, and the first parent node that is greater than the last node will be the answer.