Tree solution for Ruby Day 2 HW

tree.rb

class Tree
  attr_accessor :children, :node_name

  def initialize(node = {})
    (node.length == 1) && (@node_name = node.first[0]) || @node_name = 'root'
    children = (@node_name == 'root') ? node :  node[@node_name]
    @children = []
    children.each do |k, v|
      @children.push(Tree.new({k => v}))
    end
  end

  def visit_all(&block)
     visit &block
     children.each {|c| c.visit_all &block}
  end

  def visit(&block)
    block.call self
  end
end

nodes = {
  'grandpa' => {
    'dad' => {
      'child1' => {},
      'child2' => {}
      
    },
    'uncle' => {
      'child3' => {},
      'child4' => {}
    }
  }
}

tree = Tree.new(nodes)

tree.visit_all do |n|
  puts n.node_name
end