问题原文https://leetcode-cn.com/problems/search-in-a-binary-search-tree/description/
public TreeNode searchBST(TreeNode root, int val) {
if(root == null) return null;
if(root.val == val) return root;
else if(root.val > val) return searchBST(root.left,val);
else return searchBST(root.right,val);
}