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.
分析一:
采用中序遍历的方法,在变量val里记录前一个节点的值。当前要打印输出的节点与之前的节点比较,如果小于等于val,则返回false;否则,将val更新为当前节点的值,继续遍历。需要注意边界条件,因为TreeNode的值是int类型,最小值是-2147483648,如果val初始值设置为INT_MIN的话,单节点树,数值为INT_MIN的情况就会误判。所以程序里将val设置为long long val = -2147483649
代码如下:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBST(TreeNode *root) {
if (root == nullptr) {
return true;
}
return inOrder(root);
}
private:
long long val = -2147483649;
bool inOrder(TreeNode *root) {
if (root->left) {
bool L = inOrder(root->left);
if (!L)
return false;
}
if (root->val <= val)
return false;
val = root->val;
if (root->right) {
bool R = inOrder(root->right);
if (!R)
return false;
}
return true;
}
};
分析二:
每到一层根节点,先判断左子树是不是有效的BST,左子树遍历时会将左子树的最小值和最大值分别存放在变量全局变量minval和maxval里面。如果左子树是BST,则比较根节点和左子树里面的最大值maxval,将minval暂存一份拷贝在一个局部变量mintmp里面,因为遍历右子树的时候会覆盖当前的minval。然后判断右子树是不是有效的BST,右子树遍历时会将右子树的最小值和最大值存放在全局变量minval和maxval里面。如果右子树是BST,则比较根节点和右子树里面的最小值minval。
如果上面的情况都符合BST的规则,则更新minval = mintmp,然后向上层返回true;
代码如下:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBST(TreeNode *root) {
if (root == nullptr) {
return true;
}
return isValid(root);
}
private:
bool isValid(TreeNode *root) {
int mintmp, maxtmp;
if (root->left == nullptr) {
mintmp = root->val;
}
else {
bool L = isValid(root->val);
if (!L | root->val <= minval)
return false;
mintmp = minval;
}
if (root->right == nullptr) {
maxtmp = root->val;
}
else {
bool R = isValid(root->val);
if (!R | root->val > maxval)
return false;
maxtmp = maxval;
}
minval = mintmp;
maxval = maxtmp;
return true;
}
int minval;
int maxval;
};