# 98. 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.

Example 1:

2
/ \
1 3

Binary tree [2,1,3], return true.

Example 2:

1
/ \
2 3

Binary tree [1,2,3], return false.

## 解题思路

/**
* 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;
stack<TreeNode*> s;
TreeNode* pre = NULL;
while (root != NULL || !s.empty()) {
while (root != NULL) {
s.push(root);
root = root->left;
}
root = s.top();
s.pop();
if(pre != NULL && root->val <= pre->val) return false;
pre = root;
root = root->right;
}
return true;
}
};

©️2019 CSDN 皮肤主题: 编程工作室 设计师: CSDN官方博客