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

原创 2016年08月31日 14:57:54

1 解题思想

这题我的做法,直接就是先序遍历,遍历过程中,检查是否出错了,代码很简单。

注意用于上一个值追踪的last,一开始必须要比Int的最小值小才行,所以用了long

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.Validate Binary Search Tree (有效二叉搜索树) 解题思路和方法

Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined...

[Leetcode] 98. Validate Binary Search Tree 解题报告

题目: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST i...

LeetCode 98. Validate Binary Search Tree(校验二叉搜索树)

原题网址:https://leetcode.com/problems/validate-binary-search-tree/ Given a binary tree, determine if ...

LeetCode 98 Validate Binary Search Tree(判断二叉搜索树)

Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined a...

98. Validate Binary Search Tree(判断合法二叉搜索树)

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as ...

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

【098-Validate Binary Search Tree(验证二叉搜索树)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a binary tree,...

【LeetCode】98. Validate Binary Search Tree 解法,中序遍历,搜索二叉树合法性

98. Validate Binary Search Tree Total Accepted: 90083 Total Submissions: 430775 Difficulty: Med...

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

给出一个二叉树,判断其是否是合法的二叉查找树。

【LeetCode】Validate Binary Search Tree 解题报告

今天CSDN博客发生异常,折腾了大半天终于发出了这篇博文。 【题目】 Given a binary tree, determine if it is a valid binary sear...

[leetcode]Validate Binary Search Tree (判断有效二叉搜索树 C语言实现)

Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BS...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)