题目:
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
分析:
代码:
/**
* 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:
bool flag=true;
int pre=0;
bool isValidBST(TreeNode* root) {
if(!root)return true;
return (isValidBST(root->left)&&check(root->val)&&isValidBST(root->right));
}
bool check(int val){
if(flag){
pre=val;
flag=false;
return true;
}
if(pre>=val)return false;
pre=val;
return true;
}
};