Binary Tree Increment By One Exercise

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

Write a recursive function to increment by one the value for every node in the binary tree pointed at by "root". Assume that nodes store integer values.
void BTinc(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= "BTincPROG"; } else { return ""; }

For this exercise, you need to do a traversal that visits each node of the tree, and increments the value by 1. No information needs to be returned.

element() gets the value for a node, and setElement(value) sets the value for the node.