二叉树中是否存在某值

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
        }
    }
}