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

Add appropriate lines of code to the following function skeleton so that the function will recursively count the number of nodes in the binary tree pointed at by "root".

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

If the root is null, then return 0.

Otherwise, return 1 plus the count for the left and right children.