C# 7 and .NET Core 2.0 High Performance

Circular linked lists

In circular linked lists, the last node points back to the first node. Here is a representation of a circular linked list:

Here are a few circumstances where a linked list is useful:

• To provide access to an item in a sequential manner
• Insert an item in any position of the list
• Remove any item at any point or node
• When you need to consume less memory, as there is no array copy in the linked list

The following table shows the Big O notation value for each operation that can be performed on linked lists:

Operations	Big O notation
Access the item	O(1)
Search for the item	O(n)
Insert item	O(1)