Types of Linked List

Basically we c ( ) put linked lists into the following four types

Singly-linked list

Doubly linked list

Circular linked list

Circular doubly list

1.      A singly linked list is one in which all nodes are linked together in some sequential manner. Hence it is also called liner linked list clearly it has the beginning and the end. The problem with this list is that we cannot access the predecessor of node from the current node. This can be overcome in doubly linked lists.

2.      A doubly linked list is one in which all nodes are linked together by multiple links which help in accessing both the successor node (next node) and predecessor node (previous node) for any arbitrary node within the list. Therefore each node in a doubly linked list fields (pointers) to the left node (previous) direction. A doubly linked list is shown in figure 7.3

3.      A circular linked list is one which has no beginning and no end. A singly linked list can be made a circular linked list by simply sorting the address of the very first node in the link field of the last node. 

4.      A circular doubly linked list is one which has both the successor pointer and predecessor pointer in circular manner.

Data Structure & Algorithms Assignment Help, Live Experts 

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.