Scribd
Upload
92 views

Linked List: A Linked List Is A Sequence of Data Structures, Which Are Connected Together Via Links

A linked list is a sequence of data structures connected together via links. Each link contains a connection to the next link and data. Linked lists allow items to be navigated sequentially and come in different types like singly, doubly, and circular linked lists. Basic operations on linked lists are insertion, deletion, display, search, and delete which allow adding, removing, finding, and displaying elements in the linked list.

Uploaded by

Jel MC
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
92 views

Linked List: A Linked List Is A Sequence of Data Structures, Which Are Connected Together Via Links

A linked list is a sequence of data structures connected together via links. Each link contains a connection to the next link and data. Linked lists allow items to be navigated sequentially and come in different types like singly, doubly, and circular linked lists. Basic operations on linked lists are insertion, deletion, display, search, and delete which allow adding, removing, finding, and displaying elements in the linked list.

Uploaded by

Jel MC
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

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.
Types of Linked List

Following are the various types of linked list.


• Singly Linked List − Item navigation is forward
only.
• Doubly Linked List − Items can be navigated
forward and backward.
• 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.
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.
Insertion Operation
Deletion Operation

You might also like