一道Easy级别的题目
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.
基本思路就是从root开始, 每次找到左子树的最大值和右子树的最小值,分别于当前根节点的value比较,一旦两边都满足大小关系,则可以保证从根节点看去,左边所有结点的value都小于根节点的值,右边所有结点的值都大于根节点value的值。 左子树的最大值在最远的右侧leaf上,右子树同理
接着在分别check下层的子节点是否也满足以上的原则。
一旦有一个结果是不满足的立马返回false,结束比较。另外从下层子节点返回来的false必须传递给上层调用,也返回相应的false
class Solution {
public:
int findMax(TreeNode *root) {
int ret = root->val;
while (root->right != NULL) root = root->right;
ret = root->val;
return ret;
}
int findMin(TreeNode *root) {
int ret = root->val;
while (root->left != NULL) root = root->left;
ret = root->val;
return ret;
}
bool isValidBST(TreeNode *root) {
if (root == NULL)
return true;
int min, max;
bool ans;
if (root->left != NULL) {
max = findMax(root->left);
if (max >= root->val)
return false;
}
if (root->right != NULL) {
min = findMin(root->right);
if (min <= root->val)
return false;
}
ans = isValidBST(root->left);
if (ans == false)
return false;
ans = isValidBST(root->right);
if (ans == false)
return false;
return true;
}
};
嘿嘿!好难得一遍过,即使这是Easy难度的