题目
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:
2
/ \
1 3
Binary tree
[2,1,3]
return true.
Example 2:
1
/ \
2 3
Binary tree
[1,2,3]
return false.
标签: Tree、Depth-first Search
相似问题: (M) Binary Tree Inorder Traversal
题意
判断一棵树是否为二叉搜索树(BST),二叉搜索树的定义是:
- 一个节点的左子树只包含值小于当前节点值的节点。
- 一个节点的右子树只包含值大于当前节点的节点。
- 左右子树也都应为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) {
if (root == NULL) {
return true;
} else if (!dfsLeft(root->left,root->val) || !dfsRight(root->right,root->val)){
return false;
} else {
return isValidBST(root->right) && isValidBST(root->left);
}
}
bool dfsLeft(TreeNode* root, int val) {
if (root == NULL) {
return true;
}
if (root->val >= val) {
return false;
}
return dfsLeft(root->left, val) && dfsLeft(root->right, val);
}
bool dfsRight(TreeNode* root, int val) {
if (root == NULL) {
return true;
}
if (root->val <= val) {
return false;
}
return dfsRight(root->left, val) && dfsRight(root->right, val);
}
};
中序遍历:
/**
* 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:
std::vector<int> v;
bool isValidBST(TreeNode* root) {
if (root == NULL) {
return true;
}
if (root->right == NULL && root->left == NULL) {
return true;
}
inOrderTraversal(root);
int l = v.size();
for (int i = 1; i < l; ++i) {
if (v[i] <= v[i - 1]) {
return false;
}
}
return true;
}
void inOrderTraversal(TreeNode* root) {
if (root == NULL) {
return;
}
inOrderTraversal(root->left);
v.push_back(root->val);
inOrderTraversal(root->right);
}
};