Linked List Data Structure

A linked list is a fundamental data structure in computer science. It consists of nodes where each node contains data and a reference (link) to the next node in the sequence. This allows for dynamic memory allocation and efficient insertion and deletion operations compared to arrays.

Linked-List-Data-Structure

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 :

    Introduction:

  1. What is Linked List
  2. Introduction to Linked List – Data Structure and Algorithm Tutorials
  3. Applications, Advantages and Disadvantages of Linked List
  4. Linked List vs Array

Types of Linked List

  1. Singly Linked List
  2. Doubly Linked List
  3. Circular Linked List
  4. Circular Doubly Linked List
  5. Header Linked List

Basic Operations:

  1. Linked List Insertion
  2. Search an element in a Linked List (Iterative and Recursive)
  3. Find Length of a Linked List (Iterative and Recursive)
  4. Reverse a linked list
  5. Linked List Deletion (Deleting a given key)
  6. Linked List Deletion (Deleting a key at given position)
  7. Write a function to delete a Linked List
  8. Write a function to get Nth node in a Linked List
  9. Nth node from the end of a Linked List

Standard problem on Linked List:

Quick Links :

Recomended:

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



  • Last Updated : 22 Feb, 2024

Share your thoughts in the comments