Question: You have been given a recursive function to sum the values of all keys in a BST int findSum (TreeNode root, int depth) if (root

You have been given a recursive function to sum the values of all keys in a BST int findSum (TreeNode root, int depth) if (root 1- NULL) int leftSum = findSun(root->left, depth + 1); int rightSum findsun(root->right, depth + 1); cout key; if (depth !-0) cout key; else return e; Consider following binary search tree: 15 12 17 4 8 The following code is called findsum(root, ); Root is a pointer to the TreeNode whose key is 15. What is the output from cout? Note that there is a single space between values that are printed to the terminal. Note, there are no intended errors in the code
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
