中序遍历存入数组,最后为增序即可!
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void midorder(TreeNode*root,vector<int>&arr)
{
if(root)
{
midorder(root->left,arr);
arr.push_back(root->val);
midorder(root->right,arr);
}
}
bool isValidBST(TreeNode* root) {
vector<int> arr;
midorder(root,arr);
for(int i=1;i<arr.size();i++)
{
if(arr[i]<=arr[i-1])
return false;
}
return true;
}
};