2025-03-25 v. 9.1.1: added "2196. Create Binary Tree From Descriptions"

Author: fartem

README.md

@@ -745,6 +745,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2165. Smallest Value of the Rearranged Number                                       | [Link](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)                                       | [Link](./lib/medium/2165_smallest_value_of_the_rearranged_number.rb)                                       | [Link](./test/medium/test_2165_smallest_value_of_the_rearranged_number.rb)                                       |
 | 2177. Find Three Consecutive Integers That Sum to a Given Number                    | [Link](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)                    | [Link](./lib/medium/2177_find_three_consecutive_integers_that_sum_to_a_given_number.rb)                    | [Link](./test/medium/test_2177_find_three_consecutive_integers_that_sum_to_a_given_number.rb)                    |
 | 2181. Merge Nodes in Between Zeros                                                  | [Link](https://leetcode.com/problems/merge-nodes-in-between-zeros/)                                                  | [Link](./lib/medium/2181_merge_nodes_in_between_zeros.rb)                                                  | [Link](./test/medium/test_2181_merge_nodes_in_between_zeros.rb)                                                  |
+| 2196. Create Binary Tree From Descriptions                                          | [Link](https://leetcode.com/problems/create-binary-tree-from-descriptions/)                                          | [Link](./lib/medium/2196_create_binary_tree_from_descriptions.rb)                                          | [Link](./test/medium/test_2196_create_binary_tree_from_descriptions.rb)                                          |
 | 2425. Bitwise XOR of All Pairings                                                   | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/)                                                   | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb)                                                   | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb)                                                   |
 | 2429. Minimize XOR                                                                  | [Link](https://leetcode.com/problems/minimize-xor/)                                                                  | [Link](./lib/medium/2429_minimize_xor.rb)                                                                  | [Link](./test/medium/test_2429_minimize_xor.rb)                                                                  |
 | 2657. Find the Prefix Common Array of Two Arrays                                    | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/)                                    | [Link](./lib/medium/2657_find_the_prefix_common_array_of_two_arrays.rb)                                    | [Link](./test/medium/test_2657_find_the_prefix_common_array_of_two_arrays.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 = '9.1.0'
+  s.version = '9.1.1'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/2196_create_binary_tree_from_descriptions.rb

@@ -0,0 +1,28 @@
+# frozen_string_literal: true
+
+require_relative '../common/binary_tree'
+
+# https://leetcode.com/problems/create-binary-tree-from-descriptions/
+# @param {Integer[][]} descriptions
+# @return {TreeNode}
+def create_binary_tree(descriptions)
+  nodes = {}
+  children = ::Set.new
+
+  descriptions.each do |parent_val, child_val, is_left|
+    parent_node = nodes[parent_val] ||= ::TreeNode.new(parent_val)
+    child_node = nodes[child_val] ||= ::TreeNode.new(child_val)
+
+    if is_left == 1
+      parent_node.left = child_node
+    else
+      parent_node.right = child_node
+    end
+
+    children.add(child_val)
+  end
+
+  root_val = nodes.keys.find { |k| !children.include?(k) }
+
+  nodes[root_val]
+end

test/medium/test_2196_create_binary_tree_from_descriptions.rb

@@ -0,0 +1,44 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/2196_create_binary_tree_from_descriptions'
+require 'minitest/autorun'
+
+class CreateBinaryTreeFromDescriptionsTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.build_tree(
+          [50, 20, 80, 15, 17, 19]
+        ),
+        create_binary_tree(
+          [
+            [20, 15, 1],
+            [20, 17, 0],
+            [50, 20, 1],
+            [50, 80, 0],
+            [80, 19, 1]
+          ]
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.build_tree(
+          [1, 2, nil, nil, 3, 4]
+        ),
+        create_binary_tree(
+          [
+            [1, 2, 1],
+            [2, 3, 0],
+            [3, 4, 1]
+          ]
+        )
+      )
+    )
+  end
+end