[LeetCode] 98. Validate Binary Search Tree

[LeetCode] 98. Validate Binary Search Tree

---

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.

---

递归，传入节点的值跟对应的路径，如果是该节点的左子树，就必须比该节点小，反之亦然。。

优化是传入当前节点必须在的区间范围。

---

class Solution {
public:
    bool helper(TreeNode* root, vector<int> vals, vector<bool> path) {
        if (root == NULL) return true;

        for (int i=0; i<vals.size(); ++i) {
            if (path[i]) {
                if (root->val >= vals[i]) return false;
            } else {
                if (root->val <= vals[i]) return false;
            }
        } 

        vals.push_back(root->val);
        path.push_back(true);
        if (!helper(root->left, vals, path)) return false;
        path[path.size()-1] = false;
        if (!helper(root->right, vals, path)) return false;
        return true;
    }

    bool isValidBST(TreeNode* root) {
        if (root == NULL) return true;
        vector<int> vals;
        vals.push_back(root->val);
        vector<bool> path;

        path.push_back(true);
        if (!helper(root->left, vals, path)) return false;
        path[0] = false;
        if (!helper(root->right, vals, path)) return false;
        return true;
    }
};