Link List

[azeem_a_k]

A linklist is a type of data structure which is built from structures and pointers. The linked list is a container class of all types of objects. There are mainly three types of linklist are given below...

1. Single Linklist.
2. Double Linklist.
3. Circular Linklist.

1. Single Linklist - In single linklist we can move only one direction called forward direction and could not back from the node to previous node. Every node has its data and the address of the next node.

2. Double Linklist - In double linklist we can move in both directions. It has two way linklist and it is upgraded version of single linklist. Every node has previous node address, its data and next node address. The first node called head of the list has null value in previous nodes address and the last node has also null value in the next node address.

3. Circular Linklist - The circular linklist is similar to double link list but it has no head node and it has no null value in any node. Actually in a circular linklist the lat node of the link connects to the first node of the list so the double link list becomes the circular linklist.

In linklist the data can be add, delete and read any time but we can not access data randomly. Suppose we are at node one and want to check node three data then we have to move first to second node and then third node. We can not go directly from first node to third node.

[D_C]

Do you have a question? Because that just seems like strictly information.

[softspoker]

plz give me the basic implementation theme of sing linklist

A linklist is a type of data structure which is built from structures and pointers. The linked list is a container class of all types of objects. There are mainly three types of linklist are given below...

1. Single Linklist.
2. Double Linklist.
3. Circular Linklist.

1. Single Linklist - In single linklist we can move only one direction called forward direction and could not back from the node to previous node. Every node has its data and the address of the next node.

2. Double Linklist - In double linklist we can move in both directions. It has two way linklist and it is upgraded version of single linklist. Every node has previous node address, its data and next node address. The first node called head of the list has null value in previous nodes address and the last node has also null value in the next node address.

3. Circular Linklist - The circular linklist is similar to double link list but it has no head node and it has no null value in any node. Actually in a circular linklist the lat node of the link connects to the first node of the list so the double link list becomes the circular linklist.

In linklist the data can be add, delete and read any time but we can not access data randomly. Suppose we are at node one and want to check node three data then we have to move first to second node and then third node. We can not go directly from first node to third node.

[sicarie]

Please review our Homework Policy. If you want basic information, please utilize Google and Wikipedia.