LeetCode - Validate Binary Search Tree

来源:互联网 发布:python 开源项目 编辑:程序博客网 时间:2024/03/29 14:57

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.
bool check(TreeNode* root, int minValue, int maxValue) {    if (NULL == root) {        return true;    }    return (root->val > minValue) && (root->val < maxValue)            && check(root->left, minValue, root->val)            && check(root->right, root->val, maxValue);}bool isValidBST(TreeNode *root) {    // Start typing your C/C++ solution below    // DO NOT write int main() function    return check(root, INT_MIN, INT_MAX);}

原创粉丝点击