Scribd
Upload
481 views

Linked List Notes

Linked lists are a data structure that store elements non-contiguously using nodes. Each node contains a data field and a pointer to the next node. There are different types of linked lists including singly linked lists where each node points to the next node and circular linked lists where the last node points to the first node. Linked lists provide dynamic memory allocation and allow easy insertion/deletion of nodes but have slower access times than arrays and require additional memory for pointers.

Uploaded by

Gudiya Vyas
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
481 views

Linked List Notes

Linked lists are a data structure that store elements non-contiguously using nodes. Each node contains a data field and a pointer to the next node. There are different types of linked lists including singly linked lists where each node points to the next node and circular linked lists where the last node points to the first node. Linked lists provide dynamic memory allocation and allow easy insertion/deletion of nodes but have slower access times than arrays and require additional memory for pointers.

Uploaded by

Gudiya Vyas
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Linked List

1. What is linked list? What are different types of linked list? OR


Write a short note on singly, circular and doubly linked list. OR
Advantages and disadvantages of singly, circular and doubly linked list.

• A linked list is a collection of objects stored in a list form.


• A linked list is a sequence of items (objects) where every item is linked to the next.
• A linked list is a non primitive type of data structure in which each element is dynamically allocated and
in which elements point to each other to define a linear relationship.
• Elements of linked list are called nodes where each node contains two things, data and pointer to next
node.
• Linked list require more memory compared to array because along with value it stores pointer to next
node.
• Linked lists are among the simplest and most common data structures. They can be used to implement
other data structures like stacks, queues, and symbolic expressions, etc…

Node
// C Structure to represent a node
info link struct node
{
int info
Data Pointer to struct node *link
};
next node

Operations on linked list


• Insert
o Insert at first position
o Insert at last position
o Insert into ordered list
• Delete
• Traverse list (Print list)
• Copy linked list

Types of linked list


Singly Linked List
• It is basic type of linked list.
• Each node contains data and pointer to next node.
• Last node’s pointer is null.
• Limitation of singly linked list is we can traverse only in one direction, forward direction.

1
Linked List

A next B next C next D null

Singly Linked List


2. Discuss advantages and disadvantages of linked list over array.

Advantages of an array
1. We can access any element of an array directly means random access is easy
2. It can be used to create other useful data structures (queues, stacks)
3. It is light on memory usage compared to other structures

Disadvantages of an array
1. Its size is fixed
2. It cannot be dynamically resized in most languages
3. It is hard to add/remove elements
4. Size of all elements must be same.
5. Rigid structure (Rigid = Inflexible or not changeable)

Advantages of Linked List


1. Dynamic size
2. It is easy to add/remove/change elements
3. Elements of linked list are flexible, it can be primary data type or user defined data types

Disadvantages of Linked List


1. Random access is not allowed. We have to access elements sequentially starting from the
first node. So we cannot do binary search with linked lists.
2. It cannot be easily sorted
3. We must traverse 1/2 the list on average to access any element
4. More complex to create than an array
5. Extra memory space for a pointer is required with each element of the list

You might also like