What is the difference between 1 –way and 2-way linked list? Discuss their implementation
Answers
Answered by
5
Both the lists are used to store dynamic data.
Major difference is : singly linked list is "unidirectional traverse of data" where as doubly linked is "bi-directional traverse of data".
Singly linked lists contain nodes which have a data field as well as a 'next' field, which points to the next node in line of nodes. Operations that can be performed on singly linked lists include insertion, deletion and traversal.In a 'doubly linked list', each node contains, besides the next-node link, a second link field pointing to the 'previous' node in the sequence. The two links may be called 'forward('s') and 'backwards', or 'next' and 'prev'('previous').
please add brainlist
Major difference is : singly linked list is "unidirectional traverse of data" where as doubly linked is "bi-directional traverse of data".
Singly linked lists contain nodes which have a data field as well as a 'next' field, which points to the next node in line of nodes. Operations that can be performed on singly linked lists include insertion, deletion and traversal.In a 'doubly linked list', each node contains, besides the next-node link, a second link field pointing to the 'previous' node in the sequence. The two links may be called 'forward('s') and 'backwards', or 'next' and 'prev'('previous').
please add brainlist
Similar questions