Merge pull request #1 from davidrupp/davidrupp-94-binary-tree-inorder-traversal

davidrupp · web-flow · commit f5690bbba0d2 · 2022-12-21T21:25:37.000-05:00
Create 94-Binary-Tree-Inorder-Traversal.rb
diff --git a/ruby/94-Binary-Tree-Inorder-Traversal.rb b/ruby/94-Binary-Tree-Inorder-Traversal.rb
@@ -0,0 +1,21 @@
+# 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 inorder_traversal(root)
+    result = []
+    return result if root.nil?
+
+    result << inorder_traversal(root.left)
+    result << root.val
+    result << inorder_traversal(root.right)
+    
+    result.flatten
+end
