binaryTree.js

var binaryTree = new BTree(values) //values are a collection of values for the node of the binaryThree

var recursiveIteration = function(node, numberToSearch) {
  if(node.value == numberToSearch) return node.position;
  if(!!node.leftChild.exists() && !!node.rightChild.exists()) return 'Nothing matchs, check other branch'
  recursiveIteration(node.child)  
}

var searchValInTree = function (numberToSearch, tree ) { //number is the value to search
  var top = tree.level(1)
  recursiveIteration(top.leftChild())
  recursiveIteration(top.rightChild())
}