2024-10-02 v. 6.7.3: added "230. Kth Smallest Element in a BST"

Author: fartem

README.md

@@ -538,3 +538,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 209. Minimum Size Subarray Sum                                  | [Link](https://leetcode.com/problems/minimum-size-subarray-sum/)                                  | [Link](./lib/medium/209_minimum_size_subarray_sum.rb)                                  | [Link](./test/medium/test_209_minimum_size_subarray_sum.rb)                                  |
 | 215. Kth Largest Element in an Array                            | [Link](https://leetcode.com/problems/kth-largest-element-in-an-array/)                            | [Link](./lib/medium/215_kth_largest_element_in_an_array.rb)                            | [Link](./test/medium/test_215_kth_largest_element_in_an_array.rb)                            |
 | 227. Basic Calculator II                                        | [Link](https://leetcode.com/problems/basic-calculator-ii/)                                        | [Link](./lib/medium/227_basic_calculator_ii.rb)                                        | [Link](./test/medium/test_227_basic_calculator_ii.rb)                                        |
+| 230. Kth Smallest Element in a BST                              | [Link](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)                              | [Link](./lib/medium/230_kth_smallest_element_in_a_bst.rb)                              | [Link](./test/medium/test_230_kth_smallest_element_in_a_bst.rb)                              |

leetcode-ruby.gemspec

@@ -5,7 +5,7 @@ require 'English'
 ::Gem::Specification.new do |s|
   s.required_ruby_version = '>= 3.0'
   s.name = 'leetcode-ruby'
-  s.version = '6.7.2'
+  s.version = '6.7.3'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/230_kth_smallest_element_in_a_bst.rb

@@ -0,0 +1,24 @@
+# frozen_string_literal: true
+
+# @param {TreeNode} root
+# @param {Integer} k
+# @return {Integer}
+def kth_smallest(root, k)
+  nums = []
+  apply230(root, nums)
+
+  nums[k - 1]
+end
+
+private
+
+# @param {TreeNode} root
+# @param {Array} nums
+# @return {Void}
+def apply230(node, nums)
+  return unless node
+
+  apply230(node.left, nums)
+  nums << node.val
+  apply230(node.right, nums)
+end

test/medium/test_230_kth_smallest_element_in_a_bst.rb

@@ -0,0 +1,48 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/230_kth_smallest_element_in_a_bst'
+require 'minitest/autorun'
+
+class KthSmallestElementInABSTTest < ::Minitest::Test
+  def test_default_one
+    assert_equal(
+      1,
+      kth_smallest(
+        ::TreeNode.new(
+          3,
+          ::TreeNode.new(
+            1,
+            nil,
+            ::TreeNode.new(2)
+          ),
+          ::TreeNode.new(4)
+        ),
+        1
+      )
+    )
+  end
+
+  def test_default_two
+    assert_equal(
+      3,
+      kth_smallest(
+        ::TreeNode.new(
+          5,
+          ::TreeNode.new(
+            3,
+            ::TreeNode.new(
+              2,
+              ::TreeNode.new(1),
+              nil
+            ),
+            ::TreeNode.new(4)
+          ),
+          ::TreeNode.new(6)
+        ),
+        3
+      )
+    )
+  end
+end