# Describe various types of linked list in data structure and algorithm?

0 like 0 dislike
1.8k views

retagged

In this article you will get to know various types of list with figures, and definitions, and how to insert node and delete node from various positions using algorithm.

 Where can I do online courses From Word's Top Instructors? UDEMY:: Attend All Udemy Courses in Just INR 450[Coupon] Coursera:: Join For FREE

0 like 0 dislike
by (562 points)
selected

1. ## Single linked list :

• Item navigation is one way only. Also called one way list due to forward only navigation option.

• It is linear collection of data item called node ,where each node has divided into two part,i.e. data part and link part.

• Data part stores the data item and link part store the address of next node.

• Last item contains link of the first elements as next and first element has link to last element as previous.

• The circular single linked list is a linked list similar as single linked list. The only difference between the circular linked list and the single linked list is the address part of the last node in circular linked list.

• It contains the address of first node in the list. So here, no address part of any more contains ‘null’.Here, also one pointer is used to point the first node in the linked list.

Chains:

A chain is a linked list in which each node represents one element.

Two way list:

• Double and circular list.

• Double linked list is a variation of linked list in which navigation is possible in both ways i. e. either forward or backward.

Node:

• Each node of a linked list store the data.

Next:

Prev: