leetcode【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.

题目的大致意思是输入一个二叉树，判断是否是搜索二叉树，输入的二叉树的数据结构如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

解题思路：

考虑到中序遍历的方法，先确定左子树是一个搜索二叉树，然后确实自身的值要比前一个根节点的值大，如果比前一个根节点小或者等于，则返回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 {
	TreeNode* pre = nullptr;
	bool valid = true;
public:
	bool isValidBST(TreeNode* root) {
        isValid(root);
        return valid;
	}

	void isValid(TreeNode* root) {
        if(!root)   return;
        isValid(root->left);
        if(pre && pre->val >= root->val)   valid = false;
	    pre = root;
        isValid(root->right);
    }
};