2024-12-24 v. 7.4.7: added "701. Insert into a Binary Search Tree"

Author: fartem

README.md

@@ -611,3 +611,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 678. Valid Parenthesis String                                   | [Link](https://leetcode.com/problems/valid-parenthesis-string/)                                   | [Link](./lib/medium/678_valid_parenthesis_string.rb)                                   | [Link](./test/medium/test_678_valid_parenthesis_string.rb)                                   |
 | 687. Longest Univalue Path                                      | [Link](https://leetcode.com/problems/longest-univalue-path/)                                      | [Link](./lib/medium/687_longest_univalue_path.rb)                                      | [Link](./test/medium/test_687_longest_univalue_path.rb)                                      |
 | 692. Top K Frequent Words                                       | [Link](https://leetcode.com/problems/top-k-frequent-words/)                                       | [Link](./lib/medium/692_top_k_frequent_words.rb)                                       | [Link](./test/medium/test_692_top_k_frequent_words.rb)                                       |
+| 701. Insert into a Binary Search Tree                           | [Link](https://leetcode.com/problems/insert-into-a-binary-search-tree/)                           | [Link](./lib/medium/701_insert_into_a_binary_search_tree.rb)                           | [Link](./test/medium/test_701_insert_into_a_binary_search_tree.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 = '7.4.6'
+  s.version = '7.4.7'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/701_insert_into_a_binary_search_tree.rb

@@ -0,0 +1,19 @@
+# frozen_string_literal: true
+
+require_relative '../common/binary_tree'
+
+# https://leetcode.com/problems/insert-into-a-binary-search-tree/
+# @param {TreeNode} root
+# @param {Integer} val
+# @return {TreeNode}
+def insert_into_bst(root, val)
+  return ::TreeNode.new(val) unless root
+
+  if val < root.val
+    root.left = insert_into_bst(root.left, val)
+  else
+    root.right = insert_into_bst(root.right, val)
+  end
+
+  root
+end

test/medium/test_701_insert_into_a_binary_search_tree.rb

@@ -0,0 +1,80 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/701_insert_into_a_binary_search_tree'
+require 'minitest/autorun'
+
+class InsertIntoABinarySearchTreeTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.new(
+          4,
+          ::TreeNode.new(
+            2,
+            ::TreeNode.new(1),
+            ::TreeNode.new(3)
+          ),
+          ::TreeNode.new(
+            7,
+            ::TreeNode.new(5),
+            nil
+          )
+        ),
+        insert_into_bst(
+          ::TreeNode.new(
+            4,
+            ::TreeNode.new(
+              2,
+              ::TreeNode.new(1),
+              ::TreeNode.new(3)
+            ),
+            ::TreeNode.new(7)
+          ),
+          5
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.new(
+          40,
+          ::TreeNode.new(
+            20,
+            ::TreeNode.new(10),
+            ::TreeNode.new(
+              30,
+              ::TreeNode.new(25),
+              nil
+            )
+          ),
+          ::TreeNode.new(
+            60,
+            ::TreeNode.new(50),
+            ::TreeNode.new(70)
+          )
+        ),
+        insert_into_bst(
+          ::TreeNode.new(
+            40,
+            ::TreeNode.new(
+              20,
+              ::TreeNode.new(10),
+              ::TreeNode.new(30)
+            ),
+            ::TreeNode.new(
+              60,
+              ::TreeNode.new(50),
+              ::TreeNode.new(70)
+            )
+          ),
+          25
+        )
+      )
+    )
+  end
+end