1
class Solution {
2
  public TreeNode searchBST(TreeNode root, int val) {
3
    if (root == null) return root;
4
    if (root.val == val) {
5
      return root;
6
    } else {
7
      return val < root.val ? searchBST(root.left, val) : searchBST(root.right, val);
8
    }
9
  }
10
}