递归
class Solution {
private:
vector<int> vec;
void traversal(TreeNode* root){
if(root==nullptr) return;
if(root->left!=nullptr) traversal(root->left);
vec.push_back(root->val);
if(root->right!=nullptr) traversal(root->right);
}
public:
bool isValidBST(TreeNode* root) {
traversal(root);
for(int i=1;i<vec.size();i++){
if(vec[i]<=vec[i-1]) return false;
}
return true;
}
};
递归,简洁版
class Solution {
public:
TreeNode* pre=nullptr;
bool isValidBST(TreeNode* root) {
if(root==nullptr) return true;
bool left=isValidBST(root->left);
if(pre!=nullptr&&pre->val>=root->val) return false;
pre=root;
bool right=isValidBST(root->right);
return left&&right;
}
};
迭代法:
class Solution {
public:
bool isValidBST(TreeNode* root) {
stack<TreeNode*> st;
TreeNode* cur=root;
TreeNode* pre=nullptr;
while(cur!=nullptr||!st.empty()) {
if(cur!=nullptr){
st.push(cur);
cur=cur->left;
}
else{
cur=st.top();
st.pop();
if(pre!=nullptr&&cur->val<=pre->val) return false;
pre=cur;
cur=cur->right;
}
}
return true;
}
};