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 d963cc57e..725f40ea4 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
@@ -34,8 +34,8 @@ Output: 3
 ### Constraints
 
 - The number of nodes in the tree is n.
+- $1 \leq \text{k} \leq \text{n} \leq 10^4$
 - $1 \leq k \leq n \leq 10^4$
-- $0 \leq \text{Node.val} \leq 10^4$
 
 ### Approach