From eec22c3d51797a5d3a5a79736c9d3ce0c2607cb7 Mon Sep 17 00:00:00 2001
From: Anshika Yadav <14anshika7yadav@gmail.com>
Date: Mon, 10 Jun 2024 11:26:18 +0530
Subject: [PATCH] updated

---
 .../0200-0299/0230-Kth-smallest-element-in-BST.md           | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/dsa-solutions/lc-solutions/0200-0299/0230-Kth-smallest-element-in-BST.md b/dsa-solutions/lc-solutions/0200-0299/0230-Kth-smallest-element-in-BST.md
index 383dc4e8b..52ec4b4d6 100644
--- a/dsa-solutions/lc-solutions/0200-0299/0230-Kth-smallest-element-in-BST.md
+++ b/dsa-solutions/lc-solutions/0200-0299/0230-Kth-smallest-element-in-BST.md
@@ -1,5 +1,5 @@
 ---
-id: kth smallest element in binary search tree
+id: kth-smallest-element-in-binary-search-tree
 title: Kth Smallest Element in Binary Search Tree
 sidebar_label: 0230 Kth Smallest Element in Binary Search Tree
 tags:
@@ -34,8 +34,8 @@ Output: 3
 ### Constraints
 
 - The number of nodes in the tree is n.
-- `1 <= k <= n <= 10^4`
-- `0 <= Node.val <= 10^4`
+- $1 \leq \text{k} \leq \text{n} \leq 10^4$
+- $0 \leq \text{Node.val} \leq 10^4$
 
 ### Approach