(Solved) : Given Recursive Function Sum Values Keys Bst Int Findsum Treenode Root Int Depth Root 1 Nu Q32431722 . . .
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 << root->key; if (depth !-0) cout <<“” return leftSum rightSumroot->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. Show transcribed image text
Expert Answer
Answer to Given Recursive Function Sum Values Keys Bst Int Findsum Treenode Root Int Depth Root 1 Nu Q32431722 . . .
OR