Linked List Data Structure
- Last Updated : 01 Feb, 2022
Practice Problems on Linked List
Recent Articles on Linked List
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:
In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
Topics :
- Singly Linked List
- Circular Linked List
- Doubly Linked List
- Misc
- Quick Links
Singly Linked List :
- Introduction to Linked List
- Linked List vs Array
- Linked List Insertion
- Linked List Deletion (Deleting a given key)
- Linked List Deletion (Deleting a key at given position)
- Write a function to delete a Linked List
- Find Length of a Linked List (Iterative and Recursive)
- Search an element in a Linked List (Iterative and Recursive)
- Write a function to get Nth node in a Linked List
- Nth node from the end of a Linked List
- Print the middle of a given linked list
- Write a function that counts the number of times a given int occurs in a Linked List
- Detect loop in a linked list
- Find length of loop in linked list
- Function to check if a singly linked list is palindrome
- Remove duplicates from a sorted linked list
- Remove duplicates from an unsorted linked list
- Swap nodes in a linked list without swapping data
- Pairwise swap elements of a given linked list
- Move last element to front of a given Linked List
- Intersection of two Sorted Linked Lists
- Intersection point of two Linked Lists.
- QuickSort on Singly Linked List
- Segregate even and odd nodes in a Linked List
- Reverse a linked list
More >>
Circular Linked List :
- Circular Linked List Introduction and Applications,
- Circular Linked List Traversal
- Split a Circular Linked List into two halves
- Sorted insert for circular linked list
- Check if a linked list is Circular Linked List
- Convert a Binary Tree to a Circular Doubly Link List
- Circular Singly Linked List | Insertion
- Deletion from a Circular Linked List
- Circular Queue | Set 2 (Circular Linked List Implementation)
- Count nodes in Circular linked list
- Josephus Circle using circular linked list
- Convert singly linked list into circular linked list
- Circular Linked List | Set 1 (Introduction and Applications)
- Circular Linked List | Set 2 (Traversal)
- Implementation of Deque using circular array
- Exchange first and last nodes in Circular Linked List
More >>
Doubly Linked List :
- Doubly Linked List Introduction and Insertion
- Delete a node in a Doubly Linked List
- Reverse a Doubly Linked List
- The Great Tree-List Recursion Problem.
- Copy a linked list with next and arbit pointer
- QuickSort on Doubly Linked List
- Swap Kth node from beginning with Kth node from end in a Linked List
- Merge Sort for Doubly Linked List
- Create a Doubly Linked List from a Ternary Tree
- Find pairs with given sum in doubly linked list
- Insert value in sorted way in a sorted doubly linked list
- Delete a Doubly Linked List node at a given position
- Count triplets in a sorted doubly linked list whose sum is equal to a given value x
- Remove duplicates from a sorted doubly linked list
- Delete all occurrences of a given key in a doubly linked list
- Remove duplicates from an unsorted doubly linked list
- Sort the biotonic doubly linked list
- Sort a k sorted doubly linked list
- Convert a given Binary Tree to Doubly Linked List | Set
- Program to find size of Doubly Linked List
- Sorted insert in a doubly linked list with head and tail pointers
- Large number arithmetic using doubly linked list
- Rotate Doubly linked list by N nodes
- Priority Queue using doubly linked list
- Reverse a doubly linked list in groups of given size
- Doubly Circular Linked List | Set 1 (Introduction and Insertion)
- Doubly Circular Linked List | Set 2 (Deletion)
More >>
Misc :
- Skip List | Set 1 (Introduction)
- Skip List | Set 2 (Insertion)
- Skip List | Set 3 (Searching and Deletion)
- Reverse a stack without using extra space in O(n)
- An interesting method to print reverse of a linked list
- Linked List representation of Disjoint Set Data Structures
- Sublist Search (Search a linked list in another list)
- How to insert elements in C++ STL List ?
- Unrolled Linked List | Set 1 (Introduction)
- A Programmer’s approach of looking at Array vs. Linked List
- How to write C functions that modify head pointer of a Linked List?
- Given a linked list which is sorted, how will you insert in sorted way
- Can we reverse a linked list in less than O(n)?
- Practice questions for Linked List and Recursion
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
- Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
- Squareroot(n)-th node in a Linked List
- Find the fractional (or n/k – th) node in linked list
- Find modular node in a linked list
- Construct a linked list from 2D matrix
- Find smallest and largest elements in singly linked list
- Arrange consonants and vowels nodes in a linked list
- Partitioning a linked list around a given value and If we don’t care about making the elements of the list “stable”
- Modify contents of Linked List
Quick Links :
- ‘Practice Problems’ on Linked List
- ‘Videos’ on Linked List
- ‘Quizzes’ on Linked List
If you still need more assistance with your placement preparation, have a look at our Complete Interview Preparation Course. The course has been designed by our expert mentors to help students crack the coding interview of top product or service-based organizations . You get access to premium lectures, 200+ coding questions bank, resume building tips, and lifetime access to the course content. So to make sure that your next programming interview doesn’t feel like an interrogation, enroll in Complete Interview Preparation and give a boost to your placement preparation.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Data Structure and Algorithms - Linked List
Advertisements
Previous Page
Next Page
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 in Data Structure
Home > Programming languages > Data Structures
- « Previous
- Next »
- Tutorial
- Data Structure Introduction
- Linked List
- Types of Linked List
- Stack
- Queue
- Types of Queue
- Searching
- Sorting
- Trees
- Graphs
- Hashing
- File Organization
Linked List
- Linked List can be defined as collection of objects called nodes that are randomly stored in the memory.
- A node contains two fields i.e. data stored at that particular address and the pointer which contains the address of the next node in the memory.
- The last node of the list contains pointer to the null.
Linked list Data Structure
In this tutorial, you will learn about linked list data structure and it's implementation in Python, Java, C, and C++.
A linked list is a linear data structure that includes a series of connected nodes. Here, each node stores the data and the address of the next node. For example,
You have to start somewhere, so we give the address of the first node a special name called HEAD. Also, the last node in the linked list can be identified because its next portion points to NULL.
Linked lists can be of multiple types: singly, doubly, and circular linked list. In this article, we will focus on the singly linked list. To learn about other types, visit Types of Linked List.
Note: You might have played the game Treasure Hunt, where each clue includes the information about the next clue. That is how the linked list operates.
Linked List in A Data Structure: All You Need to Know
Lesson 3 of 54By Simplilearn
Last updated on Sep 19, 20216097PreviousNext
Tutorial Playlist
Data Structure Tutorial
OverviewArrays in Data Structures: A Guide With Examples
Lesson - 1All You Need to Know About Two-Dimensional Arrays
Lesson - 2All You Need to Know About a Linked List in a Data Structure
Lesson - 3The Complete Guide to Implement a Singly Linked List
Lesson - 4The Ultimate Guide to Implement a Doubly Linked List
Lesson - 5The Fundamentals for Understanding Circular Linked List
Lesson - 6The Ultimate Guide To Understand The Differences Between Stack And Queue
Lesson - 7Implementing Stacks in Data Structures
Lesson - 8Your One-Stop Solution for Stack Implementation Using Array
Lesson - 9Your One-Stop Solution for Queue Implementation Using Array
Lesson - 10Your One-Stop Solution to Learn Depth-First Search(DFS) Algorithm From Scratch
Lesson - 11Your One-Stop Solution for Stack Implementation Using Linked-List
Lesson - 12The Definitive Guide to Understand Stack vs Heap Memory Allocation
Lesson - 13All You Need to Know About Linear Search Algorithm
Lesson - 14All You Need to Know About Breadth-First Search Algorithm
Lesson - 15A One-Stop Solution for Using Binary Search Trees in Data Structure
Lesson - 16The Best Tutorial to Understand Trees in Data Structure
Lesson - 17A Complete Guide to Implement Binary Tree in Data Structure
Lesson - 18A Holistic Look at Using AVL Trees in Data Structures
Lesson - 19All You Need to Know About Tree Traversal in Data Structure
Lesson - 20The Best Guide You’ll Ever Need to Understand B-Tree in Data Structure
Lesson - 21The Best Guide You'll Ever Need to Understand Spanning Tree in Data Structure
Lesson - 22The Best and Easiest Way to Understand an Algorithm
Lesson - 23Your One-Stop Solution to Understand Shell Sort Algorithm
Lesson - 24Your One-Stop Solution to Quick Sort Algorithm
Lesson - 25The Most Useful Guide to Learn Selection Sort Algorithm
Lesson - 26Everything You Need to Know About Radix Sort Algorithm
Lesson - 27Everything You Need to Know About the Counting Sort Algorithm
Lesson - 28Everything You Need to Know About the Merge Sort Algorithm
Lesson - 29Insertion Sort Algorithm: One-Stop Solution That Will Help You Understand Insertion Sort
Lesson - 30Everything You Need to Know About the Bubble Sort Algorithm
Lesson - 31The Best Guide You’ll Ever Need to Understand Bucket Sort Algorithm
Lesson - 32Your One-Stop Solution to Understand Recursive Algorithm in Programming
Lesson - 33The Definitive Guide to Understanding Greedy Algorithm
Lesson - 34Your One-Stop Solution to Understand Backtracking Algorithm
Lesson - 35The Fundamentals of the Bellman-Ford Algorithm
Lesson - 36Your One-Stop Solution for Graphs in Data Structures
Lesson - 37The Best Guide to Understand and Implement Solutions for Tower of Hanoi Puzzle
Lesson - 38A Simplified and Complete Guide to Learn Space and Time Complexity
Lesson - 39All You Need to Know About the Knapsack Problem : Your Complete Guide
Lesson - 40The Fibonacci Series: Mathematical and Programming Interpretation
Lesson - 41The Holistic Look at Longest Common Subsequence Problem
Lesson - 42The Best Article to Understand What Is Dynamic Programming
Lesson - 43A Guide to Implement Longest Increasing Subsequence Using Dynamic Programming
Lesson - 44A Holistic Guide to Learn Stop Solution Using Dynamic Programming
Lesson - 45One Stop Solution to All the Dynamic Programming Problems
Lesson - 46Understanding the Fundamentals of Binomial Distribution
Lesson - 47Here’s All You Need to Know About Minimum Spanning Tree in Data Structures
Lesson - 48Understanding the Difference Between Array and Linked List
Lesson - 49The Best Article Out There to Understand the B+ Tree in Data Structure
Lesson - 50A Comprehensive Look at Queue in Data Structure
Lesson - 51Your One-Stop Solution to Understand Coin Change Problem
Lesson - 52The Best Way to Understand the Matrix Chain Multiplication Problem
Lesson - 53Your One-Stop Solution to Learn Floyd-Warshall Algorithm for Using Dynamic Programming
Lesson - 54
Table of Contents
View MoreA linked list is the most sought-after data structure when it comes to handling dynamic data elements. A linked list consists of a data element known as a node. And each node consists of two fields: one field has data, and in the second field, the node has an address that keeps a reference to the next node.What is a Linked List?
Post Graduate Program in Data Analytics
In partnership with Purdue UniversityView Course