What is Double Linked List?

Answer 1

The singly link list is nothing but the group of memory location in the computer memory (RAM) connected with each other using the pointer. The pointer is nothing but the location in the memory address space . The single data in list is called as nodes. Every nodes contain data and the pointer to the next data. Means one pointer in the node gives location of the next data. Suppose i have following data Memory location Data 1000 A 2000 B 3000 C since the my data A,B,C is stored in different memory locations , i can group it using singly linklist . Means my first node contain data A ,second B, & third C . The first node which contain data A will give the information about the next data or node (which is B) using the pointer. Means the pointer of A store the memory location of B (which is 2000).Like these the link will continued , at last node since there is no next node or data . Hence the pointer contain NULL value means there is (dead end).When computer encounters NULL it stop travelling through the list. & there is a special pointer called START pointer which gives the mem location of first node. In about example the node which contain data C contain NULL value in pointer field.

Answer 2

implementation refers to the code written in any programming language to implement the data structure and its associated operations. So Singly Linked list implementation is a code or class wriiten to disguise linked list data structure that can be used by other programs

Answer 3

A (singly) linked list is a data structure of nodes where each node contains a value and a pointer to the next node.

A doubly linked list is a data structure where each node has two pointers, one to the next and one to the previous node, so you can traverse the chain of links in both directions.

A multiple linked list has several pointers in each node. They are used to traverse the nodes in different orders, for example one set of links ordered by date of birth and another ordered alphabetically by name.

Answer 4

It basically means that each item contains pointers to both the next item in the list and the previous item in the list, so you can traverse the list either "forward" or "backward".

A singly-linked list only has a pointer to the next item, so you can only traverse it in one direction.

Answer 5

Singly linked lists contain nodes which have a data field as well as a next field, which points to the next node in the linked list.

Answer 6

i think it means that it has an included link to a list