2025-01-23 v. 8.2.5.7: small refactoring

Author: fartem

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

lib/common/binary_tree.rb

@@ -21,11 +21,12 @@ def self.are_equals(curr, other)
 
     return false if !curr || !other
 
-    curr_eq = curr.val == other.val
+    return false unless curr.val == other.val
+
     left_eq = are_equals(curr.left, other.left)
     right_eq = are_equals(curr.right, other.right)
 
-    curr_eq && left_eq && right_eq
+    left_eq && right_eq
   end
 
   # @param {Integer[]} nodes
@@ -39,9 +40,9 @@ def self.build_tree(nodes)
 
     while i < nodes.length
       current = queue.shift
+
       next unless current
 
-      # Left child
       if i < nodes.length && !nodes[i].nil?
         current.left = ::TreeNode.new(nodes[i])