二叉树中是否存在某值

• 循环实现

const binarySearchTree = (node = tree, target = 8) => {
  let curNode =  node
  while(true){
      if(!curNode){
          return false
      }
      if(curNode.value > target){
          curNode = curNode.left
      }else if(curNode.value < target){
          curNode = curNode.right
      }else {
          return true
      }
  }
}

• 递归实现

const isExistTarget = (tree = binarySearchTree.root, target = 35) => {
  const compare = (node) => {
    if (!node) return false;
    if (node.value > target) {
      return compare(node.left);
    } else if (node.value < target) {
      return compare(node.right);
    } else {
      return true;
    }
  };
  return compare(tree);
};