Validate Binary Search Tree

最新推荐文章于 2024-10-14 16:31:29 发布

houshion

最新推荐文章于 2024-10-14 16:31:29 发布

阅读量239

点赞数

分类专栏： LeetCode 文章标签： LeetCode Validate Binary Sear C++

本文链接：https://blog.csdn.net/lyh642784803/article/details/52040001

版权

LeetCode 专栏收录该内容

103 篇文章

订阅专栏

题目描述：

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.

解题思路：

根据一棵二叉树的中序遍历结点值是从小到大有序的，因此可以在中序遍历过程中保存遍历过的最后一个结点last，并与当前的结点进行比较

AC代码如下：

class Solution {
public:
	bool isValidBST(TreeNode* root) {
		if (root == NULL) return true;
		TreeNode* last = NULL;
		return inorderTravel(root, last);
	}

	bool inorderTravel(TreeNode* root, TreeNode*& last)
	{
		bool left, right;
		if (root == NULL) return true;
		else{
			left = inorderTravel(root->left, last);
			if (left == false || (last!=NULL && last->val >= root->val)) return false;
			last = root;
			right = inorderTravel(root->right, last);
			return right;
		}
	}
};