Linked list traversal time with Matrix Implementation
Author(s) : SANJAY RAZDAN
Abstract
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.
No fo Author(s) : 1
Page(s) : 93 - 94
Electronic ISSN : 2250 - 3765
Volume 2 :
Issue 1
Full Paper PDF
Views : 548 | Download(s) : 162
