前言
根据网上的LeetCode题目难度和出现频率表(里面都是最老的那些题目),Validate Binary Search Tree算是很重要的一道题了。 在Tree系列中也是举足轻重的一道题。
题目
https://leetcode.com/problems/validate-binary-search-tree/
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.
即给出一棵树,判断是否为BST。
分析
这道题最大众化也是最广为流传的思路有两种:
- 递归判断。对每个节点一个数值范围来限制:对根节点不限制大小(即范围为LONG_MIN到LONG_MAX),此后考察左子树和右子树,根据BST的性质来限制val值的范围。
- 中序遍历。由于BST具有的性质,中序遍历必然得到一递增序列,考察这个性质即可得出是否为Valid BST.
代码
大小限制:
/**
* 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 lower, long upper) {
if (root == NULL) return true;
return root->val > lower && root->val < upper
&& isValidBST(root->left, lower, root->val) && isValidBST(root->right, root->val, upper);
}
};
中序遍历:
class Solution {
public:
bool isValidBST(TreeNode* root) {
TreeNode* prev = NULL;
return validate(prev, root);
}
bool validate(TreeNode* &prev, TreeNode* root) {
if (root == NULL) return true;
if (!validate(prev, root->left)) return false;
if (prev != NULL && prev->val >= root->val) return false;
prev = root;
return validate(prev, root->right);
}
};