Difference between 1 way and 2 way linked list. discuss their implementation
Answers
Answered by
0
HEY USER
HERE IS UR ANSWER
Its just another way of saying singly and doubly linked list.1-way or singly linked list is the simple one in which there is one head node and other nodes are connected in forward manner. i.e, you cannot traverse backwards as there is no back pointer.2-way or doubly linked list is more advanced one in which each node contains one more link which points to the previous element/node. You can traverse forward as well as backwards in this Data structure.THANK YOU
HOPE IT HELPS
HERE IS UR ANSWER
Its just another way of saying singly and doubly linked list.1-way or singly linked list is the simple one in which there is one head node and other nodes are connected in forward manner. i.e, you cannot traverse backwards as there is no back pointer.2-way or doubly linked list is more advanced one in which each node contains one more link which points to the previous element/node. You can traverse forward as well as backwards in this Data structure.THANK YOU
HOPE IT HELPS
Similar questions
Computer Science,
7 months ago
English,
7 months ago
English,
7 months ago
Physics,
1 year ago
Computer Science,
1 year ago
Science,
1 year ago