Leetcode Validate binary search tree

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.

---

[code]

public class Solution {
    TreeNode prev=null;
    public boolean isValidBST(TreeNode root) {
        if(root==null)return true;
        if(isValidBST(root.left)==false)return false;
        if(prev!=null && root.val<=prev.val)return false;
        prev=root;
        return isValidBST(root.right);
    }
}