From cc2e468d3dd27c946e9cea55ffc6ccf22b46e00b Mon Sep 17 00:00:00 2001
From: pro100ton <pro100ton@gmail.com>
Date: Fri, 7 Mar 2025 14:20:47 +0300
Subject: [PATCH] Add solution for 230: Kth smallest element in BST

---
 .../230_Kth_smallest_element_in_BST/main.go   | 22 +++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 leetcode/binary_trees/230_Kth_smallest_element_in_BST/main.go

diff --git a/leetcode/binary_trees/230_Kth_smallest_element_in_BST/main.go b/leetcode/binary_trees/230_Kth_smallest_element_in_BST/main.go
new file mode 100644
index 0000000..19d468f
--- /dev/null
+++ b/leetcode/binary_trees/230_Kth_smallest_element_in_BST/main.go
@@ -0,0 +1,22 @@
+package main
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func traverse(root *TreeNode, res *[]int) {
+	if root == nil {
+		return
+	}
+	traverse(root.Left, res)
+	*res = append(*res, root.Val)
+	traverse(root.Right, res)
+}
+
+func kthSmallest(root *TreeNode, k int) int {
+	var result []int
+	traverse(root, &result)
+	return result[k-1]
+}