链接:https://leetcode-cn.com/problems/search-in-a-binary-search-tree/
class Solution {
public TreeNode searchBST(TreeNode root, int val) {
if(root==null){
return null;
}
if(val<root.val){
return searchBST(root.left,val);
}
if(val>root.val){
return searchBST(root.right,val);
}
return root;
}
}