Merge pull request #12 from abhishekprasad2384/main

Create Kth Smallest Element in a BST

Author: jvm-coder

Kth_Smallest_Element_in_a_BST.java

@@ -0,0 +1,15 @@
+//
+int count = 0;
+int result = Integer.MIN_VALUE;
+
+public int kthSmallest(TreeNode root, int k) {
+    traverse(root, k);
+    return result;
+}
+
+public void traverse(TreeNode root, int k) {
+    if(root == null) return;
+    traverse(root.left, k);
+    count ++;
+    if(count == k) result = root.val;
+    traverse(root.right, k);