Mumbai University > Information Technology > Sem 3 > Data Structure and Algorithm analysis

Marks: 3 M

Year: Dec 2014

1. A linked list is a linear collection of data items called as nodes, linked to one another by means of pointers.

2. Each node is divided into following two parts:

i. Information of the element.

ii. Address of the next node in the linked list.

1. Types of linked list

i. Singly linked list

ii. Doubly linked list

iii. Circular linked list

1. Advantages of linked list:

i. Linked list are dynamic data structure. That is, they can grow or shrink during the execution of a program.

ii. Efficient memory utilization: In linked list (or dynamic) representation, memory is not pre-allocated. Memory is allocated whenever it is required. And it is deallocated (or removed) when it is not needed.

iii. Insertion and deletion are easier and efficient. Linked list provides flexibility in inserting a data item at a specified position and deletion of a data item from the given position.