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 \ 5The above binary tree is serialized as
"{1,2,3,#,#,4,#,#,5}"
.
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int x) { val = x; }
* }
*/
public class Solution
{
public bool IsValidBST(TreeNode root)
{
return IsValidBST(root,null,null);
}
public bool IsValidBST(TreeNode root,TreeNode node1,TreeNode node2)
{
if (root == null)
return true;
if (node1 != null && node1.val >= root.val)
return false;
if (node2 != null && node2.val <= root.val)
return false;
return IsValidBST(root.left, node1, root) && IsValidBST(root.right,root, node2);
}
}