2025-01-09 v. 7.8.3: added "894. All Possible Full Binary Trees"

Author: fartem

README.md

@@ -635,6 +635,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 880. Decoded String at Index                                     | [Link](https://leetcode.com/problems/decoded-string-at-index/)                                     | [Link](./lib/medium/880_decoded_string_at_index.rb)                                     | [Link](./test/medium/test_880_decoded_string_at_index.rb)                                     |
 | 889. Construct Binary Tree from Preorder and Postorder Traversal | [Link](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [Link](./lib/medium/889_construct_binary_tree_from_preorder_and_postorder_traversal.rb) | [Link](./test/medium/test_889_construct_binary_tree_from_preorder_and_postorder_traversal.rb) |
 | 890. Find and Replace Pattern                                    | [Link](https://leetcode.com/problems/find-and-replace-pattern/)                                    | [Link](./lib/medium/890_find_and_replace_pattern.rb)                                    | [Link](./test/medium/test_890_find_and_replace_pattern.rb)                                    |
+| 894. All Possible Full Binary Trees                              | [Link](https://leetcode.com/problems/all-possible-full-binary-trees/)                              | [Link](./lib/medium/894_all_possible_full_binary_trees.rb)                              | [Link](./test/medium/test_894_all_possible_full_binary_trees.rb)                              |
 
 ### Hard
 

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.8.2'
+  s.version = '7.8.3'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/894_all_possible_full_binary_trees.rb

@@ -0,0 +1,38 @@
+# frozen_string_literal: true
+
+require_relative '../common/binary_tree'
+
+# https://leetcode.com/problems/all-possible-full-binary-trees/
+# @param {Integer} n
+# @return {TreeNode[]}
+def all_possible_fbt(n)
+  @values = {}
+
+  fill_all_possible_fbt(n)
+end
+
+private
+
+# @param {Integer} n
+# @result {TreeNode[]}
+def fill_all_possible_fbt(n)
+  return @values[n] if @values.key?(n)
+
+  nodes = []
+
+  if n == 1
+    nodes << ::TreeNode.new(0)
+  elsif n.odd?
+    (0...n).each do |i|
+      j = n - 1 - i
+
+      fill_all_possible_fbt(i).each do |left|
+        fill_all_possible_fbt(j).each do |right|
+          nodes << ::TreeNode.new(0, left, right)
+        end
+      end
+    end
+  end
+
+  @values[n] = nodes
+end

test/medium/test_894_all_possible_full_binary_trees.rb

@@ -0,0 +1,114 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/894_all_possible_full_binary_trees'
+require 'minitest/autorun'
+
+class AllPossibleFullBinaryTreesTest < ::Minitest::Test
+  def test_default_one
+    correct = [
+      ::TreeNode.new(
+        0,
+        ::TreeNode.new(0),
+        ::TreeNode.new(
+          0,
+          ::TreeNode.new(0),
+          ::TreeNode.new(
+            0,
+            ::TreeNode.new(0),
+            ::TreeNode.new(0)
+          )
+        )
+      ),
+      ::TreeNode.new(
+        0,
+        ::TreeNode.new(0),
+        ::TreeNode.new(
+          0,
+          ::TreeNode.new(
+            0,
+            ::TreeNode.new(0),
+            ::TreeNode.new(0)
+          ),
+          ::TreeNode.new(0)
+        )
+      ),
+      ::TreeNode.new(
+        0,
+        ::TreeNode.new(
+          0,
+          ::TreeNode.new(0),
+          ::TreeNode.new(0)
+        ),
+        ::TreeNode.new(
+          0,
+          ::TreeNode.new(0),
+          ::TreeNode.new(0)
+        )
+      ),
+      ::TreeNode.new(
+        0,
+        ::TreeNode.new(
+          0,
+          ::TreeNode.new(0),
+          ::TreeNode.new(
+            0,
+            ::TreeNode.new(0),
+            ::TreeNode.new(0)
+          )
+        ),
+        ::TreeNode.new(0)
+      ),
+      ::TreeNode.new(
+        0,
+        ::TreeNode.new(
+          0,
+          ::TreeNode.new(
+            0,
+            ::TreeNode.new(0),
+            ::TreeNode.new(0)
+          ),
+          ::TreeNode.new(0)
+        ),
+        ::TreeNode.new(0)
+      )
+    ]
+
+    result = all_possible_fbt(7)
+
+    assert_equal(5, result.size)
+
+    result.each_with_index do |node, index|
+      assert(
+        ::TreeNode.are_equals(
+          node,
+          correct[index]
+        )
+      )
+    end
+  end
+
+  def test_default_two
+    correct = [
+      ::TreeNode.new(
+        0,
+        ::TreeNode.new(0),
+        ::TreeNode.new(0)
+      )
+    ]
+
+    result = all_possible_fbt(3)
+
+    assert_equal(1, result.size)
+
+    result.each_with_index do |node, index|
+      assert(
+        ::TreeNode.are_equals(
+          node,
+          correct[index]
+        )
+      )
+    end
+  end
+end