/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int>a;
void order(TreeNode *t){
if(t==NULL)return ;
else {
order(t->left);
a.push_back(t->val);
order(t->right);
}
}
bool isValidBST(TreeNode* root) {
order(root);
if(root==NULL)return true;
for(int i=0;i<a.size()-1;i++){
if(a[i]>=a[i+1])return false;
}
return true;
}
};
01-03
324
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
11-17