/*
* 思路:验证二叉搜索树,即验证中序遍历序列是否是一个升序数组
*
*/
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>tree;
void inorder(TreeNode* root)
{
if (!root)
return;
inorder(root->left);
tree.push_back(root->val);
inorder(root->right);
}
bool isValidBST(TreeNode* root) {
inorder(root);
for (int i = 0; i < tree.size() - 1; i++)
{
if (tree[i] >= tree[i + 1])
return false;
}
return true;
}
};
二叉搜索树的特点既左节点小于根节点,右节点大于根节点,则中序遍历序列一定是一个严格的升序数组,先求中序遍历序列,再判断是否升序即可