explain All Algorithm associated with two way link list
Answers
Answered by
0
Answer:
Every nodes in the doubly linked list has three fields: LeftPointer, RightPointer and DATA. iii. The last node has a next link with value NULL, marking the end of the list, and the first node has a prev link with the value NULL. The start of the list is marked by the head pointer.
A doubly linked list or a two-way linked list is a more complex type of linked list which contains a pointer to the next as well as the previous node in sequence, Therefore, it contains three parts are data, a pointer to the next node, and a pointer to the previous node.
have a good day ♡♡♡
Similar questions