【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.

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

   1
  / \
 2   3
    /
   4
    \
     5

The above binary tree is serialized as  "{1,2,3,#,#,4,#,#,5}".

java code : simple recursion solution.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isValidBST(TreeNode root) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(root == null)
			return true;
		if(root.left != null)
		{
			if(MaxValOfTree(root.left) >= root.val)
				return false;
		}
		if(root.right != null)
		{
			if(MinValOfTree(root.right) <= root.val)
				return false;
		}
		return isValidBST(root.left) && isValidBST(root.right);
    }
    public int MinValOfTree(TreeNode root)
	{
		if(root.left == null && root.right == null)
			return root.val;
		int leftMin = root.left == null ? Integer.MAX_VALUE : MinValOfTree(root.left);
		int rightMin = root.right == null ? Integer.MAX_VALUE : MinValOfTree(root.right);
		leftMin = Math.min(leftMin, rightMin);
		return Math.min(leftMin, root.val);
	}
    
    public int MaxValOfTree(TreeNode root)
	{
		if(root.left == null && root.right == null)
			return root.val;
		int leftMax = root.left == null ? Integer.MIN_VALUE : MaxValOfTree(root.left);
		int rightMax = root.right == null ? Integer.MIN_VALUE : MaxValOfTree(root.right);
		leftMax = Math.max(leftMax, rightMax);
		return Math.max(leftMax, root.val);
	}
}