Validate Binary Search Tree (leetcode)

题目：

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.

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

   1
  / \
 2   3
    /
   4
    \
     5

The above binary tree is serialized as  "{1,2,3,#,#,4,#,#,5}".

https://oj.leetcode.com/problems/validate-binary-search-tree/ 点击打开链接

解题思路：判断中序遍历是否是升序的，且没有相同元素

#include<iostream>
using namespace std;

struct TreeNode 
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

bool inorderTraverse(TreeNode *root,int &midResult)
{
	if(root==NULL)
		return true;
	if(!inorderTraverse(root->left,midResult))
		return false;
	if(root->val<=midResult)
		return false;
	midResult=root->val;
	if(!inorderTraverse(root->right,midResult))
		return false;
	return true;
}

bool isValidBST(TreeNode *root)
{
	int midResult=INT_MIN;
	return inorderTraverse(root,midResult);
}

int main()
{
	TreeNode* root=new TreeNode(1);
	root->left=new TreeNode(2);
	root->right=new TreeNode(15);
	root->right->left=new TreeNode(6);
	root->right->right=new TreeNode(20);
	cout<<isValidBST(root)<<endl;

	system("pause");
	return 0;
}