_98. Validate Binary Search Tree.md

98. Validate Binary Search Tree

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 23, 2024

Last updated : June 23, 2024

---

Related Topics : Tree, Depth-First Search, Binary Search Tree, Binary Tree

Acceptance Rate : 33.78 %

---

Solutions

• m98.c

C

m98.c

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool isValidBSTHelper(struct TreeNode* root, long min, long max) {
    if (!root) 
        return true;

    if ((long) root->val <= min || (long) root->val >= max) 
        return false;

    bool output = true;
    
    if (root->right)
        output &= root->val < root->right->val
                    && isValidBSTHelper(root->right, (long) root->val, max);

    if (root->left)
        output &= root->left->val < root->val
                    && isValidBSTHelper(root->left, min, (long) root->val);

    return output;
}

bool isValidBST(struct TreeNode* root) {
    return isValidBSTHelper(root, LONG_MIN, LONG_MAX);
}