《LeetCode力扣练习》代码随想录——二叉树(验证二叉搜索树—Java)
刷题思路来源于 代码随想录
98. 验证二叉搜索树
-
二叉树-中序遍历
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { private TreeNode pre = null; public boolean isValidBST(TreeNode root) { TreeNode pre = null; return recursion(root); } private boolean recursion(TreeNode root) { if (root == null) { return true; } boolean left = recursion(root.left); if (pre != null && pre.val >= root.val) { return false; } pre = root; boolean right = recursion(root.right); return left && right; } }