Alternate C++ solution #98. Validate Binary Search Tree

[resyfer]

A C++ solution to the 98.Validate Binary Search Tree problem which follows Neetcode's explanation in the video.

[farhan523]

#369

 class Solution
 {
    vector<int> res;
    bool inorderTraversal(TreeNode *root)
    {
        if (root == NULL)
            return true;
        bool r1, r2;
        if (root->left != NULL && root->left->val >= root->val)
            return false;
        else
            r1 = inorderTraversal(root->left);
        res.push_back(root->val);
        if (root->right != NULL && root->right->val <= root->val)
            return false;
        else
            r2 = inorderTraversal(root->right);
        return r1 && r2;
    }

    public:
        bool isValidBST(TreeNode *root)
        {
            if (!inorderTraversal(root))
                return false;
            for (int i = 1; i < res.size(); i++)
            {

                if (res[i] <= res[i - 1])
                    return false;
            }
            return true;
        }
};

[resyfer]

Thank you for the solution, but my issue was created for a possible addition of my solution to the question which followed the solution in the video, and I've added that in the commit following the issue

[Ahmad-A0]

I'll mention #424 which is also about this problem.

[Ahmad-A0]

I'll close this issue as a parallel PR exists.