Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
14 views7 pages

Lecture 5

A Linked List is a dynamic data structure where nodes are stored in separate memory locations and connected via pointers, allowing for efficient insertions and deletions. Key characteristics include dynamic size, non-contiguous memory allocation, and the need for traversal to access elements. There are various types of linked lists, including singly, doubly, and circular linked lists, each with unique properties.

Uploaded by

aleezaarshad397
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views7 pages

Lecture 5

A Linked List is a dynamic data structure where nodes are stored in separate memory locations and connected via pointers, allowing for efficient insertions and deletions. Key characteristics include dynamic size, non-contiguous memory allocation, and the need for traversal to access elements. There are various types of linked lists, including singly, doubly, and circular linked lists, each with unique properties.

Uploaded by

aleezaarshad397
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Linked Lists in Data Structures

Linked List
Definition: A Linked List is a linear data structure in
which elements (called nodes) are stored in separate
memory locations and connected using pointers. Each
node contains:
• Data – The actual value stored in the node.
• Pointer (or Link) – The address of the next node in
the sequence.
Visual Representation: [10 | *] → [20 | *] → [30 | *]
→ [40 | NULL].

2
Key Characteristics of Linked Lists
• Dynamic Size – Unlike arrays, linked lists can grow and shrink
dynamically.
• Efficient Insertions/Deletions – Inserting or deleting an element
doesn’t require shifting elements like in arrays.
• Non-Contiguous Memory Allocation – Nodes are stored in
different memory locations and connected using pointers.

• Extra Memory for Pointers – Each node requires extra memory


to store the address of the next node.

• Sequential Access – Unlike arrays, direct access to elements is not


possible; traversal is needed. 3
Advantages of Arrays
• Dynamic Memory Allocation – No need to define the
size beforehand.
• Efficient Insertions & Deletions – Especially useful
when inserting/deleting elements frequently.
• No Wasted Memory – Unlike arrays, there is no need
to reserve memory in advance.

4
Limitations of Arrays
• Extra Memory Usage – Each node stores an additional
pointer, increasing memory consumption.
• Slower Access Time – No direct indexing like arrays;
traversal is needed to access an element.
• More Complex Implementation – Managing pointers
correctly is crucial to avoid memory leaks and dangling
pointers.

5
Applications of Arrays
• Dynamic Memory Management – Used in heap
memory allocation.
• Implementation of Stacks & Queues – Used as a base
structure.
• Graph Representation – Used in adjacency lists.
• Undo/Redo Operations – Common in text editors.
• Music Playlists – Used for next/previous song
navigation.

6
Types of Arrays
1. Singly Linked List – Each node contains data and a
pointer to the next node.
2. Doubly Linked List – Each node contains pointers
to both previous and next nodes.
3. Circular Linked List – The last node points back to
the first node, forming a circular structure.
• Singly Circular Linked List
• Doubly Circular Linked List.

You might also like