Merge pull request neetcode-gh#1313 from voski/patch-14

Create 102-Binary-Tree-Level-Order-Traversal.rb

ruby/102-Binary-Tree-Level-Order-Traversal.rb

@@ -0,0 +1,32 @@
+# Definition for a binary tree node.
+# class TreeNode
+# attr_accessor :val, :left, :right
+# def initialize(val = 0, left = nil, right = nil)
+# @val = val
+# @left = left
+# @right = right
+# end
+# end
+# @param {TreeNode} root
+# @return {Integer[][]}
+def level_order(root)
+ result = []
+
+ level = []
+ level << root if root
+ until level.empty?
+ vals = []
+ next_level = []
+
+ level.each do |node|
+ vals << node.val
+ next_level << node.left if node.left
+ next_level << node.right if node.right
+ end
+
+ result << vals
+ level = next_level
+ end
+
+ result
+end