题目
解题思路
二叉搜索树的特性为:(节点为二叉搜索树上的任一节点)
- 节点的左子树所有节点均比当前节点值小;
- 节点的右子树所有节点均比当前节点值大。
方法1:
根据上述特性,可以采用递归方法实现,向下递归时,传递左右子树的取值范围;
方法2:
另一种递归方式是:判断节点的左子树是否为有效的二叉搜索树,再判断当前节点的数值是否比左儿子大,再判断节点的右子树是否为有效的二叉搜索树,判断右儿子的值是否比当前节点数值大;
方法3:
利用二叉树中序遍历结果为从小到大依次排列的特性。
算法实现
方法1:
/**
* 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:
long long min_v = (long long)INT_MIN - 1;
long long max_v = (long long)INT_MAX + 1;
bool isValidBST(TreeNode* root) {
if (!root)
return true;
return isValidBST(root, min_v, max_v);
}
bool isValidBST(TreeNode* curNode, long long min, long long max){
if (!curNode)
return true;
if (curNode->val <= min || curNode->val >= max)
return false;
return isValidBST(curNode->left, min, curNode->val) && isValidBST(curNode->right, curNode->val, max);
}
};
方法2:
/**
* 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:
long long preValue = (long long)INT_MIN - 1;
bool isValidBST(TreeNode* root) {
if (!root)
return true;
if (!isValidBST(root->left))
return false;
if (root->val <= preValue)
return false;
preValue = root->val;
return isValidBST(root->right);
}
};
方法3:
/**
* 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) {
if (!root)
return true;
stack<TreeNode*> nodeStack;
TreeNode* curNode = root;
long long preValue = (long long)INT_MIN - 1;
while (curNode || !nodeStack.empty())
{
while (curNode)
{
nodeStack.push(curNode);
curNode = curNode->left;
}
if (!nodeStack.empty())
{
curNode = nodeStack.top();
nodeStack.pop();
if (curNode->val <= preValue)
return false;
preValue = curNode->val;
curNode = curNode->right;
}
}
return true;
}
}