LeetCode 98 Validate Binary Search Tree解题方法

LeetCode 98 Validate Binary Search Tree解题方法

初七还是蛮菜的，这个题初七在做的时候只考虑了每个子树符合条件，但是没有考虑到子树里的结点应该与根节点的做比较，所以[10,5,15,null,null,6,20]这个testcase的结果是错误的。所以我最后写了一个辅助函数进行比较。

题目描述

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

Input: [2,1,3]
Output: true
Example 2:

    5
   / \
  1   4
     / \
    3   6

Input: [5,1,4,null,null,3,6]
Output: false
Explanation: The root node's value is 5 but its right child's value is 4.

Recursion方法解题

以[10,5,15,null,null,6,20]为例
辅助函数设置两个值low和high，对于右子树来说，最小值就是根节点10，所以，所有的右子树的值都应大于10，对于左子树来说，最大值为10，所以，左子树的值都应小于10。当某个节点为null时，返回true。

Java代码

/**
 * 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 {
    public boolean isValidBST(TreeNode root) {
        return func(root,null,null);
    }
    
    public static boolean func(TreeNode node, Integer low, Integer high){
        if(node == null)
            return true;
        int val = node.val;
        if(low !=null && node.val<=low) return false;
        if(high !=null && node.val >= high) return false;
            
        if(!func(node.right,val, high)) return false;
        if(!func(node.left,low,val)) return false;
        return true;
    }
}