中序遍历结果放入一个数组中,判断数组是否升序即可。
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void _isValidBST(TreeNode *root, vector<int> &v){
if(root==NULL)
return;
_isValidBST(root->left,v);
v.push_back(root->val);
_isValidBST(root->right,v);
}
bool isValidBST(TreeNode *root) {
vector<int> v;
_isValidBST(root,v);
for(int i=1;i<v.size();i++)
if(v[i]<=v[i-1])
return false;
return true;
}
};