Merge pull request #696 from fartem/103_Binary_Tree_Zigzag_Level_Order_Traversal

2024-08-01 v. 6.3.7: added "103. Binary Tree Zigzag Level Order Traversal"

Author: fartem

README.md

@@ -502,3 +502,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 98. Validate Binary Search Tree                             | [Link](https://leetcode.com/problems/validate-binary-search-tree/)                             | [Link](./lib/medium/98_validate_binary_search_tree.rb)                             |
 | 99. Recover Binary Search Tree                              | [Link](https://leetcode.com/problems/recover-binary-search-tree/)                              | [Link](./lib/medium/99_recover_binary_search_tree.rb)                              |
 | 102. Binary Tree Level Order Traversal                      | [Link](https://leetcode.com/problems/binary-tree-level-order-traversal/)                       | [Link](./lib/medium/102_binary_tree_level_order_traversal.rb)                      |
+| 103. Binary Tree Zigzag Level Order Traversal               | [Link](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)                | [Link](./lib/medium/103_binary_tree_zigzag_level_order_traversal.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.3.6'
+  s.version = '6.3.7'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/103_binary_tree_zigzag_level_order_traversal.rb

@@ -0,0 +1,28 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/
+# @param {TreeNode} root
+# @return {Integer[][]}
+def zigzag_level_order(root)
+  return [] unless root
+
+  result = []
+  deq = [root]
+  rev = true
+  until deq.empty?
+    level = []
+    size = deq.size
+    rev = !rev
+    (0...size).reverse_each do |_i|
+      node = deq.shift
+      level << node.val
+      deq << node.left if node.left
+      deq << node.right if node.right
+    end
+
+    level.reverse! if rev
+    result << level
+  end
+
+  result
+end

test/medium/test_102_binary_tree_level_order_traversal.rb

@@ -21,7 +21,15 @@ def test_default
         )
       )
     )
-    assert_equal([[1]], level_order(::TreeNode.new(1)))
-    assert_equal([], level_order(nil))
+    assert_equal(
+      [[1]],
+      level_order(
+        ::TreeNode.new(1)
+      )
+    )
+    assert_equal(
+      [],
+      level_order(nil)
+    )
   end
 end

test/medium/test_103_binary_tree_zigzag_level_order_traversal.rb

@@ -0,0 +1,35 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/103_binary_tree_zigzag_level_order_traversal'
+require 'minitest/autorun'
+
+class BinaryTreeZigzagLevelOrderTraversalTest < ::Minitest::Test
+  def test_default
+    assert_equal(
+      [[3], [20, 9], [15, 7]],
+      zigzag_level_order(
+        ::TreeNode.new(
+          3,
+          ::TreeNode.new(9),
+          ::TreeNode.new(
+            20,
+            ::TreeNode.new(15),
+            ::TreeNode.new(7)
+          )
+        )
+      )
+    )
+    assert_equal(
+      [[1]],
+      zigzag_level_order(
+        ::TreeNode.new(1)
+      )
+    )
+    assert_equal(
+      [],
+      zigzag_level_order(nil)
+    )
+  end
+end