Mastering data structures in Ruby — Circular linked lists

The defining factor for circular linked lists is that they allow us to traverse them infinitely. Since they had no tail, whenever a list reaches its “end” it wraps around and restarts from its head over and over again.Circular lists can be singly or doubly linked, and like their closest relatives, they are just sequences of connected nodes.If you haven’t read my previous posts on this series, I recommend you to do so because in this post I’m going to gloss over some important concepts that were discussed thoroughly on previous posts.