feat: kth-smallest-element-in-a-bst

Author: minji-go

kth-smallest-element-in-a-bst/minji-go.java

@@ -4,7 +4,7 @@
  * <li>Topics: Tree, Depth-First Search, Binary Search Tree, Binary Tree</li>
  * <li>Time Complexity: O(N), Runtime 0ms   </li>
  * <li>Space Complexity: O(H), Memory 44.5MB</li>
- * <li>Note: if the BST is modified often,  
+ * <li>Note: if the BST is modified often,
  */
 class Solution {
     public int kthSmallest(TreeNode root, int k) {