700. Search in a Binary Search Tree

class Solution {
    public TreeNode searchBST(TreeNode root, int val) {
        return treeTravsal(root, val);
    }
    
    private TreeNode treeTravsal(TreeNode root, int val){
        
        if(root == null){
            return null;
        }
        if(root.val > val){
           return treeTravsal(root.left, val);
        }else if(root.val < val){
            return treeTravsal(root.right, val);
        }else if(root.val == val){
            return root;
        }
        return root;
    }
}