题目链接:click~
/*题意:判断二叉树是否是BST*/
/**
*思路:中序遍历整棵树,记录结点的前驱结点,当前结点大于前驱结点,返回false
*
*/
class Solution {
public:
void checkBST(TreeNode *root, TreeNode *&pre, bool &flag) {
if(root == NULL) return;
checkBST(root->left, pre, flag);
if(pre != NULL && root->val <= pre->val) {
flag = false;
return;
}
pre = root; //记录前驱结点
checkBST(root->right, pre, flag);
}
bool isValidBST(TreeNode *root) {
if(root == NULL) return true;
bool flag = true;
TreeNode *pre = NULL;
checkBST(root, pre, flag);
return flag;
}
};