Leetcode 98. 验证二叉搜索树

98. Validate Binary Search Tree

Medium

2124316FavoriteShare

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.

这道题目看上去容易，实际上有一定的难度

使用不断递归下去的方法实现的。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {
        return helper(root,LONG_MIN,LONG_MAX);
    }
    
    bool helper(TreeNode* root, long min, long max){
        if(root==nullptr) return true;
        if(root->val<=min || root->val>=max) return false;
        return helper(root->left,min,root->val) && helper(root->right,root->val,max);
    }
};

另外可以借助中序遍历将结果存下来，验证这个结果是否是升序的。但这个空间复杂度更高。

还有一种做法是适应非递归的中序遍历，边遍历边判断。