Update tree.rb

Author: tarunvelli

contents/tree_traversal/code/ruby/tree.rb

@@ -3,18 +3,18 @@ def create_tree(rows, children)
 
   {
     id: rows,
-    children: Array.new(3, create_tree(rows - 1, children))
+    children: Array.new(children, create_tree(rows - 1, children))
   }
 end
 
 def dfs_preorder(tree)
-  puts tree[:id]
+  print "#{tree[:id]} "
   tree[:children].each { |child| dfs_preorder(child) }
 end
 
 def dfs_postorder(tree)
   tree[:children].each { |child| dfs_postorder(child) }
-  puts tree[:id]
+  print "#{tree[:id]} "
 end
 
 def dfs_inorder(tree)
@@ -24,16 +24,16 @@ def dfs_inorder(tree)
     raise 'Postorder traversal is only valid for binary trees'
   end
 
-  dfs_inorder(tree.children[0])
-  puts tree[:id]
-  dfs_inorder(tree.children[1])
+  dfs_inorder(tree[:children][0])
+  print "#{tree[:id]} "
+  dfs_inorder(tree[:children][1])
 end
 
 def dfs_iterative(tree)
   stack = [tree]
   while stack.count.positive?
     current = stack.pop
-    puts current[:id]
+    print "#{current[:id]} "
     stack.push(*current[:children])
   end
 end
@@ -42,13 +42,24 @@ def bfs(tree)
   queue = [tree]
   while queue.count.positive?
     current = queue.shift
-    puts current[:id]
+    print "#{current[:id]} "
     queue.push(*current[:children])
   end
 end
 
-root = create_tree(3, 3)
+root = create_tree(2, 3)
+puts "[#]\nRecursive DFS:"
 dfs_preorder(root)
+puts ""
+puts "[#]\nRecursive Postorder DFS:"
 dfs_postorder(root)
+puts ""
+puts "[#]\nStack-based DFS:"
 dfs_iterative(root)
+puts ""
+puts "[#]\nQueue-based DFS:"
 bfs(root)
+puts ""
+root_binary = create_tree(3, 2);
+puts "[#]\nRecursive Inorder DFS for Binary Tree:"
+dfs_inorder(root_binary)