Binary Tree Check Value Exercise

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

Write a recursive function that returns true if there is a node in the given binary tree with the given value, and false otherwise. Note that this tree is not be a Binary Search Tree.
boolean BTcheckval(BinNode root, Comparable value) { // 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= "BTcheckvalPROG"; } else { return ""; }

If the current node has the value that you are looking for, then return.

If the result of calling the function recursively on either subtree returns true, then return true. Otherwise, return false.