Linked List Traversal Time with Matrix Implementation
R. Sanjay · Computer Science and its Applications · 2012
This paper proposes the matrix structure of the linked lists to reduce the time required to access any given node . In order to access the Nth node in a linked list we need to traverse all (N-1) nodes. In our matrix structure we do not need to traverse all (N-1) nodes, hence time is reduced.