We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c1f583f commit 1aadb6fCopy full SHA for 1aadb6f
dsa-solutions/lc-solutions/0200-0299/0230-Kth-smallest-element-in-BST.md
@@ -1,5 +1,5 @@
1
---
2
-id: kth smallest element in binary search tree
+id: kth-smallest-element-in-binary-search-tree
3
title: Kth Smallest Element in Binary Search Tree
4
sidebar_label: 0230 Kth Smallest Element in Binary Search Tree
5
tags:
@@ -34,8 +34,8 @@ Output: 3
34
### Constraints
35
36
- The number of nodes in the tree is n.
37
-- `1 <= k <= n <= 10^4`
38
-- `0 <= Node.val <= 10^4`
+- $1 \leq k \leq n \leq 10^4$
+- $0 \leq \text{Node.val} \leq 10^4$
39
40
### Approach
41
0 commit comments