Scribd
Upload
33 views9 pages

Linked List: CCC121 - Data Structures and Algorithms

The document discusses linked lists, which are data structures composed of connected links that contain elements. Each link contains a reference to the next link. There are three main types of linked lists: singly linked lists where navigation is forward only, doubly linked lists where navigation is bidirectional, and circular linked lists where the last element links to the first element. The document outlines basic linked list operations like insertion, deletion, display and search and provides interactive examples and videos for further explanation.

Uploaded by

Joshua Madula
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
33 views9 pages

Linked List: CCC121 - Data Structures and Algorithms

The document discusses linked lists, which are data structures composed of connected links that contain elements. Each link contains a reference to the next link. There are three main types of linked lists: singly linked lists where navigation is forward only, doubly linked lists where navigation is bidirectional, and circular linked lists where the last element links to the first element. The document outlines basic linked list operations like insertion, deletion, display and search and provides interactive examples and videos for further explanation.

Uploaded by

Joshua Madula
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/ 9

Linked List

CCC121 – Data Structures and Algorithms


Discussions

01 Linked List

02 Linked List Representation

03 Linked List Basic Operations

04 Types of Linked List


Note
Several resources will be presented in the following sections. These resources
provide interactive examples where you can run it and modify it for practice
purposes. Some resources also provide videos in the bottom part of the webpage
to understand the topic easier.

Suggestion: Running some of the interactive examples might not work on some mobile browsers.
You may copy & paste it instead on a mobile IDE (Ex. Dcoder) and run the program.
Overview

Check the video link below for an overview introduction of linked list:

• Linked Lists
Linked List

A linked list is a sequence of data structures, which are connected together via links.
Linked List is a sequence of links which contains items. Each link contains a connection
to another link. Linked list is the second most-used data structure after array. Following
are the important terms to understand the concept of Linked List.

• Link − Each link of a linked list can store a data called an element.
• Next − Each link of a linked list contains a link to the next link called Next.
• LinkedList − A Linked List contains the connection link to the first link called First.
Linked List Representation

Linked list can be visualized as a chain of nodes, where every node points to
the next node.

As per the above illustration, following are the important points to be considered.
• Linked List contains a link element called first.
• Each link carries a data field(s) and a link field called next.
• Each link is linked with its next link using its next link.
• Last link carries a link as null to mark the end of the list.
Linked List Basic Operations

Following are the basic operations supported by a list.


• Insertion − Adds an element at the beginning of the list.
• Deletion − Deletes an element at the beginning of the list.
• Display − Displays the complete list.
• Search − Searches an element using the given key.
• Delete − Deletes an element using the given key.

Click the following resources for more details:

• Linked List Data Structure (Introduction)


• Linked List (Interactive Examples and Video)
Types of Linked List

Following are the various types of linked list.

• Simple/Singly Linked List − Item navigation is forward only.


• Linked List Insertion (Interactive Examples and Video)
• Linked List Deletion (Interactive Examples and Video)

• Doubly Linked List − Items can be navigated forward and backward.


• Doubly Linked List (Interactive Examples)

• Circular Linked List − Last item contains link of the first element as next and the first
element has a link to the last element as previous.
• Circular Linked List Set 1 | Circular Linked List Set 2 (Interactive Examples)
END OF PRESENTATION

You might also like