The S-Linked List - A Variant Of The Linked List Data Structure

Using doubly linked list in embedded systems can be expensive. Although doubly linked is efficient in terms of time complexity and highly flexible in itself, enabling easy traversal and update, but it often demands more memory space compared to other list data strucure – this is as a result of the space required for the extra pointers, doubling the amount needed for a singly linked list. In this paper, we introduce the S-linked list – a hybrid of the concept of the singly linked list and the circular linked list. The hybrid gives a data structure that is similar to the unrolled linked list, but rather than have an array in each node, we have a singly linked list. An analysis of the space complexity and assymptotic time complexity of the algorithm was carried out.