[Leetcode] #98 Validate Binary Search Tree

Discription:

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.

Solution:

//输出中序遍历结果 看其是否递增
void inorder(TreeNode* root, vector<int> &nums)
{
	if (root == NULL) return;
	inorder(root->left, nums);
	nums.push_back(root->val);
	inorder(root->right, nums);
}

bool isValidBST(TreeNode* root) {
	if (!root) return true;
	vector<int> nums;
	inorder(root, nums);
	for (int i = 0; i < nums.size() - 1; i++){
		if (nums[i]>=nums[i + 1])
			return false;
	}
	return true;
}

//根据中序遍历来看，不需要额外空间
bool isValidBST(TreeNode* root) {
	TreeNode* prev = NULL;
	return validate(root, prev);
}
bool validate(TreeNode* node, TreeNode* &prev) {
	if (node == NULL) return true;
	if (!validate(node->left, prev)) return false;
	if (prev != NULL && prev->val >= node->val) return false;
	prev = node;
	return validate(node->right, prev);
}

//方法三
bool isValidBST(TreeNode* root) {
	return isValidBST(root, NULL, NULL);
}

bool isValidBST(TreeNode* root, TreeNode* minNode, TreeNode* maxNode) {
	if (!root) return true;
	if (minNode && root->val <= minNode->val || maxNode && root->val >= maxNode->val)
		return false;
	return isValidBST(root->left, minNode, root) && isValidBST(root->right, root, maxNode);
}

GitHub-Leetcode:https://github.com/wenwu313/LeetCode

参考：https://leetcode.com/problems/validate-binary-search-tree/?tab=Solutions