Linked lists are a topic I frequently discuss with students. So for this month’s blog post, I want to present a linked-list practice problem. We’ll look at a variation on the traditional singly-linked list, called a singly-linked circular list with a tail pointer. How can we insert into this type of list, and how can we search one for a given value?