double linked listin a doubly linked list also


Double Linked List

In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of the preceding elements in the list. The second part have the information of the element and the third part is known as next pointer field.

 

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: double linked listin a doubly linked list also
Reference No:- TGS0282668

Expected delivery within 24 Hours