2 原题

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.
Example 1:
2
/ \
1   3
Binary tree [2,1,3], return true.
Example 2:
1
/ \
2   3
Binary tree [1,2,3], return false.


3 AC解

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
long last = Long.MIN_VALUE;
//采用左中右遍历后检查是否递增
public boolean isValidBST(TreeNode root) {
if (root == null) return true;
if ( !isValidBST(root.left) ) return false;
if (root.val <= last) return false;
last = root.val;
return isValidBST(root.right) ;
}
}

leetcode 98. 验证二叉搜索树

2018-03-10 22:08:54

查找算法（二叉搜索树查找，二分查找，hash查找）

2016-07-12 12:58:16

【LeetCode-面试算法经典-Java实现】【098-Validate Binary Search Tree（验证二叉搜索树）】

2015-08-06 07:47:41

Leetcode 98 Validate Binary Search Tree 验证二叉查找树

2015-05-27 11:55:58

lintcode(95)验证二叉查找树

2017-04-26 10:51:45

验证二叉查找树

2015-08-26 23:28:01

LINTCODE —— 验证二叉查找树

2017-09-16 10:48:29

判断一棵二叉树是否为二叉搜索树(BST)

2016-11-11 23:11:23

lintcode-验证查找二叉树-95

2015-09-09 19:26:38

lintcode validate-binary-search-tree 验证二叉查找树

2016-07-22 17:03:33

不良信息举报

Leetcode 98. Validate Binary Search Tree 验证二叉搜索树 解题报告