# LeetCode-validate-binary-search-tree

125人阅读 评论(0)

## 题目描述

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 keysgreater 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}".

/**
* Definition for binary tree
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
private Integer pre = null;
public boolean isValidBST(TreeNode root) {

if(root == null)
return true;
if(!isValidBST(root.left))
return false;
if(pre != null && root.val <= pre)
return false;
pre = root.val;
if(!isValidBST(root.right))
return false;

return true;
}
}

pre值保存着根节点的值，尤其是在比较左孩子的时候，不但要判断左孩子的子树是否是BST，更要与根节点比。

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：24004次
• 积分：1353
• 等级：
• 排名：千里之外
• 原创：112篇
• 转载：30篇
• 译文：0篇
• 评论：4条
阅读排行
评论排行
最新评论