class Solution {
public:
int cnt = 0;
int prev = -INT_MAX;
bool res = true;
bool isValidBST(TreeNode* root) {
dfs(root);
return res;
}
void dfs(TreeNode* root){
if(root==nullptr) return;
dfs(root->left);
if(cnt!=0&&root->val<=prev) res = false;
prev = root->val;
cnt++;
dfs(root->right);
}
};
Leetcode Hot100 第77题 98. 验证二叉搜索树
最新推荐文章于 2025-08-22 19:21:44 发布