98.Validate Binary Search Tree - 版本历史

Riguz：/* Recursive */

2024-01-17T17:19:32Z

Recursive

←上一版本		2024年1月17日 (三) 17:19的版本
第33行：		第33行：

	= Recursive =		= Recursive =
			{{Submission\|runtime=0ms\|memory=44.65MB\|rp=100\|mp=9.94}}


	<syntaxhighlight lang="java">		<syntaxhighlight lang="java">

Riguz：/* Description */

2024-01-17T17:18:44Z

Description

@@ 第32行： / 第32行： @@
 Explanation: The root node's value is 5 but its right child's value is 4.
 [[Category:Algorithm]]
 [[Category:LeetCode]]

Riguz：创建页面，内容为“=Description= {{LeetCode |id=validate-binary-search-tree |no=98 |difficulty=Medium |category=Tree |collection=MS |title=Validate Binary Search Tree |summary=Given the root of a binary tree, determine if it is a valid binary search tree (BST).}} Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right s…”

2024-01-17T16:57:53Z

创建页面，内容为“=Description= {{LeetCode |id=validate-binary-search-tree |no=98 |difficulty=Medium |category=Tree |collection=MS |title=Validate Binary Search Tree |summary=Given the root of a binary tree, determine if it is a valid binary search tree (BST).}} Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right s…”

新页面

=Description=
{{LeetCode
|id=validate-binary-search-tree
|no=98
|difficulty=Medium
|category=Tree
|collection=MS
|title=Validate Binary Search Tree
|summary=Given the root of a binary tree, determine if it is a valid binary search tree (BST).}}

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

A valid 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:

<syntaxhighlight lang="bash">
Input: root = [2,1,3]
Output: true
</syntaxhighlight>
Example 2:
<syntaxhighlight lang="bash">
Input: root = [5,1,4,null,null,3,6]
Output: false
</syntaxhighlight>
Explanation: The root node's value is 5 but its right child's value is 4.

[[Category:Algorithm]]
[[Category:LeetCode]]

98.Validate Binary Search Tree - 版本历史

Riguz：​/* Recursive */

Riguz：​/* Description */

Riguz：/* Recursive */

Riguz：/* Description */