We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent bef2091 commit c1f583fCopy full SHA for c1f583f
dsa-solutions/lc-solutions/0000-0099/0098-validate-binary-search-tree.md
@@ -1,5 +1,5 @@
1
---
2
-id: validate binary search tree
+id: validate-binary-search-tree
3
title: Validate Binary Search Tree
4
sidebar_label: 0098 Validate Binary Search Tree
5
tags:
@@ -40,7 +40,7 @@ Output: false
40
### Constraints
41
42
- The number of nodes in the tree is in the range $[1, 10^4]$.
43
-- `-2^(31) <= Node.val <= 2^(31) - 1.`
+- $-2^(31) \leq \text{Node.val} \leq 2^(31) - 1$.
44
45
### Approach
46
0 commit comments