Even Odd Tree

class Solution {
public:
    array<int, 100000> chk;
    bool isEvenOddTree(TreeNode* root, int dep = 0) {
        if(root == nullptr) return true;
        if(chk[dep] == 0 && dep % 2) chk[dep] = INT_MAX;
        if(1 - dep % 2 != root->val % 2) return false;
        if( dep & 1 && chk[dep] <= root->val) return false;
        if(~dep & 1 && chk[dep] >= root->val) return false;
        chk[dep] = root->val;
        return isEvenOddTree(root->left, dep + 1) && isEvenOddTree(root->right, dep + 1);
    }
};