9、二叉搜索js实现 var searchBST = function(root, val) { let node = root; while(node && node.val !== val) { node = node.val > val ? node.left : node.right; } return node; };