Question: 3. Consider a BST that stores integer type values. Write a function, sumMinMax, that calculates the sum of smallest and largest value present in the

3. Consider a BST that stores integer type values. Write a function, sumMinMax, that calculates the sum of smallest and largest value present in the tree and prints the value. For the following tree, the function should output 12 (i.e 3 + 9). (5 marks) 7 9 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
