Merge pull request neetcode-gh#1203 from razer96/230-Kth-Smallest-Element-in-a-BST.go

230. Kth Smallest Element in a BST go solution.go

Author: dissesmac

go/230-Kth-Smallest-Element-in-a-BST.go

@@ -0,0 +1,22 @@
+func kthSmallest(root *TreeNode, k int) int {
+	stack := make([]*TreeNode, 0, k)
+
+	for {
+		for root != nil {
+			stack = append(stack, root)
+			root = root.Left
+		}
+
+		root = stack[len(stack) - 1]
+		stack = stack[:len(stack) - 1]
+
+		k--
+		if k == 0 {
+			return root.Val
+		}
+
+		root = root.Right
+	}
+
+	return -1
+}