题目
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.
Example 1:
Input:
2
/ \
1 3
Output: true
Example 2:
5
/ \
1 4
/ \
3 6
Output: false
Explanation: The input is: [5,1,4,null,null,3,6]. The root node’s value is 5 but its right child’s value is 4.
思路
学习大神的想法,采用递归的方法求解思路比较简单。对于一个节点,其值一定大于他的左子树的所有值,小于他的右子树的所有值,可以发现,该节点的值可以作为左子树的最大值,右子树的最小值。
利用该性质编写代码,在每次遍历中,用节点的值替代左子树的最大值和右子树的最小值。对于根节点,最小值和最大值分别为LONG_MIN和LONG_MAX。
代码
/**
* 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 isValidBST(TreeNode* root) {
return isValidBST(root,LONG_MIN,LONG_MAX);
}
bool isValidBST(TreeNode* root, long min, long max)
{
if(!root)
return true;
if(root->val<=min||root->val>=max)
return false;
return isValidBST(root->left,min,root->val)&&isValidBST(root->right,root->val,max);
}
};