Mastering data structures in Ruby — Singly linked lists

A singly linked list is a data structure that allows us to manage variable-sized collections of elements.Unlike C style arrays, singly linked lists can grow or shrink dynamically based on the number of objects they have to store. This property makes them a nice fit for those cases where the number of elements is unknown beforehand.Each element on the linked list is represented by a node that contains two attributes:.