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

Download Now
Provided by: Journal of Computing
Topic: Data Management
Format: PDF
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 structure - 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, the authors introduce the S-linked list - a hybrid of the concept of the singly linked list and the circular linked list.
Download Now

Find By Topic