问题描述
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 3Binary tree
[2,1,3]
, return true.
Example 2:
1 / \ 2 3Binary tree
[1,2,3]
, return false.
解题思路
要判断二叉树是否为二分查找树只需要将其中序遍历一遍,并将元素依次保存到数组中,看元素是否升序排列即可,注意元素之间不能相等。
代码如下
class Solution {
public:
bool isValidBST(TreeNode* root) {
if (root == NULL) return true;
vector<int> vec;
inorder(vec, root);
for (int i = 0; i < vec.size() - 1; i++) {
if (vec[i] >= vec[i+1]) return false;
}
return true;
}
void inorder(vector<int> &vec, TreeNode* root) {
if (root == NULL) return;
inorder(vec, root->left);
vec.push_back(root->val);
inorder(vec, root->right);
}
};