leetcode第51题（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.

思路：

跟上题一样，中序遍历，pre是记录中序遍历的前一节点，如果该值大于当前值，则不是二叉排序树。

代码：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    TreeNode pre;
    boolean flag = true;
    public boolean isValidBST(TreeNode root) {
        inTraversal(root);
        return flag;
    }
    public void inTraversal(TreeNode root){
        if(root == null){
            return;
        }
        inTraversal(root.left);
        if(pre!=null && pre.val>root.val){
            flag = false;
        }
        pre = root;
        inTraversal(root.right);
    }
}

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.