题目:
题源:LeetCode
题解:
看得官方题解,回头消化了再来补!
代码一:
代码二:
class Solution {
public:
int flag=1;
long long front=LONG_MIN;//长整型最小值
bool isValidBST(TreeNode* root) {
mid(root);
return flag;
}
void mid(TreeNode *root){
if(root==NULL) return;
mid(root->left);
if(root->val<=front) flag=0;
front=root->val;
mid(root->right);
}
};