【leetcode】700. Search in a Binary Search Tree

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode searchBST(TreeNode root, int val) {
        if(root==null)
            return null;
        
        if(root.val==val)
            return root;
        
        if(val<root.val)
            return searchBST(root.left, val);
        else
            return searchBST(root.right, val);
    }
}