Linear Linked List Implementation in Ruby

linked_list.rb

class LinkedList
  attr_accessor :list

  def initialize
    @list = []
  end
  
  def add_node(data)
    node = Struct.new(:data, :next)
    new_node = node.new(data, nil)
    list.last.next = new_node if list.last
    list << new_node    
  end
 
  def last
    list.any? ? list.last : nil
  end
  
  def all
    list
  end
  
end

## Usage ##
# llist = LinkedList.new
# llist.add_node(2)
# llist.add_node(5)
# first_node = llist.all.first
# first_node.next.data