leetcode 98. Validate Binary Search Tree

最新推荐文章于 2022-09-08 08:57:02 发布

zbxzc

最新推荐文章于 2022-09-08 08:57:02 发布

阅读量387

点赞数

分类专栏：数据结构与算法 OJ 文章标签： leetcode

本文链接：https://blog.csdn.net/u014568921/article/details/50857761

版权

数据结构与算法同时被 2 个专栏收录

213 篇文章 1 订阅

订阅专栏

196 篇文章 0 订阅

订阅专栏

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.

class Solution {
	TreeNode*pre;
	bool f;
	void leftrootright(TreeNode*node)
	{
		if (node&&node->left)
			leftrootright(node->left);
		if (node)
		{
			if (!pre)
				pre = node;
			else
			{
				if (pre->val >= node->val)
					f = false;
				pre = node;
			}
			cout << node->val;
		}
		if (node&&node->right)
			leftrootright(node->right);
	}
public:
	bool isValidBST(TreeNode* root) {
		if (root == NULL)
			return true;
		pre = NULL;
		f = true;
		leftrootright(root);
		return f;
	}
};

accepted