Scribd
Upload
17 views7 pages

Linked List

Data structure and algorithms

Uploaded by

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

Linked List

Data structure and algorithms

Uploaded by

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

Unit 1: Linear Data

Structures
Linked List
Linked List
 A linked list is a sequence of items, which are connected together via links.
 Linked list is the second most-used data structure after array.

Important terms-
 Node- Individual element in the linked list
 Data − Each node of a linked list can store an element called a Data.
 Next − A link or pointer to the next link called Next.
 Head − A Linked List contains the- link to the first node called Head.

Basic Operations:-
 Create
 Insert Node
 Delete Node
 Display elements in the list/ Traverse the list
Linked List
Types
Singly Linear Linked List
Singly Circular Linked List
Doubly Linear Linked List
Doubly Circular Linked list
Singly Linear and Singly Circular
Linked List
Doubly Linear and Doubly
Circular Linked List
Basic Operations on Linked List
 Traversal: To traverse all the nodes one after
another.
 Insertion: To add a node at the given position.
 Deletion: To delete a node.
 Searching: To search an element(s) by value.
 Updating: To update a node.
 Sorting: To arrange nodes in a linked list in a
specific order.
 Merging: To merge two linked lists into one.

You might also like