Question: int findSum(TreeNoderoot, int depth) if(root != NULL) int leftSum findSum(root->left, depth 1); int rightSum = findsun(root-right, depth + 1); cout key; if (depth ! cout


int findSum(TreeNoderoot, int depth) if(root != NULL) int leftSum findSum(root->left, depth 1); int rightSum = findsun(root-right, depth + 1); cout key; if (depth ! cout key; else return 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
