HackerRank - Cracking the Code Interview - Trees: Is This a Binary Search Tree

Here's my Java solution for [HackerRank and Cracking the Code Interview's Trees: Is This a Binary Search Tree problem] (https://www.hackerrank.com/challenges/ctci-is-binary-search-tree).

public class Solution {

    boolean checkBST(Node root) {
         return checkBST(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
    }

    boolean checkBST(Node root, int min, int max) {
        if (root == null) return true;

        if (root.data <= min || root.data >= max) return false;

        return checkBST(root.left, min, root.data) && checkBST(root.right, root.data, max);
    }

}