Binary Tree Sum Nodes Exercise

(function(){ window.OpenPopKa = true;}())

Write a recursive function that returns the sum of the values for all of the nodes of the binary tree with root "root".
int BTsumall(BinNode root) { // Your code goes between these lines // Your code goes between these lines }

[editor.getValue()]

if (guess[0] != initEditor) { console.log(guess[0]); window.codeValue = guess[0]; window.progexType= "BTRecurTutor"; window.summexName= "BTsumallPROG"; } else { return ""; }

If the root is null, return 0.

Otherwise, just return the sum of the root value plus the result of the recursive calls on the children.