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.

思路：使用递归，或者中序遍历记录前向节点的值

bool isValidBST(BinTree* root)
{
	if(root ==NULL)
		return true;
	else
	{
		
		if(root->right != NULL&& root->left == NULL)
			return  isValidBST(root->right)&& root->value <root->right->value;
		else if(root->left != NULL && root->right == NULL)
			return isValidBST(root->left)&& root->value > root->left->value;
		else if(root->left != NULL && root->right != NULL)
			return isValidBST(root->right)&&isValidBST(root->left)&& root->value >root->left->value && root->value < root->right->value;
		else
			return true;	
			
	}
}

第二种方法和中序遍历非常相似，因为中序遍历的结果是有序的，记录前序节点，当前节点和前序节点相比较即可

BinTree* cur=NULL,*pre= NULL;
bool isValidBSTSecond(BinTree* root)
{
	if(root== NULL)
		return true;
	bool left = isValidBSTSecond(root->left);
	
	if(pre == NULL)
		pre = root;
	cur = root;
	if(cur != pre && pre->value > cur->value)
		return false;		
	pre = cur;
	
	bool right =isValidBSTSecond(root->right);
	return right&&left;
	
	
}