Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Singly Linked Lists: Concepts and Coding
New
Rating: 4.0 out of 5(1 rating)
15 students

Singly Linked Lists: Concepts and Coding

Learn singly linked lists in C by building, creating, and traversing linked lists with hands-on coding examples.
New
Created byPretty Diana Cyril
Last updated 7/2026
English

What you'll learn

  • Explain the fundamentals of linked lists and compare singly linked lists with arrays in terms of memory representation, storage, and data access.
  • Create and implement singly linked lists by designing nodes, linking them together, and performing list traversal operations.
  • Apply insertion techniques to add nodes at the beginning, end, a specific position, or before and after a given node in a singly linked list.
  • Perform deletion operations by removing nodes from different positions, deleting the entire linked list, and managing memory efficiently.
  • Develop C programs to solve singly linked list problems, including reversing a linked list and implementing common linked list operations.

Explore related topics

Course content

3 sections • 10 lectures • 1h 56m total length

  • Introduction to Linked List9:45
  • Why Linked List?9:22
  • Array vs. Singly Linked List (Representation)13:49

Requirements

  • Basic knowledge of C programming (variables, loops, functions, and arrays).

Description

Singly Linked Lists: Concepts and Coding is a beginner-friendly course designed to help you understand one of the most important linear data structures used in computer science and software development. Whether you are a student, aspiring programmer, or preparing for technical interviews, this course will provide a strong foundation in singly linked lists using the C programming language.

You will begin by learning what a linked list is, why it is needed, and how it differs from arrays in terms of memory representation and flexibility. The course then guides you through creating the building blocks of a singly linked list, including designing a node, allocating memory dynamically, and constructing a complete linked list from scratch.

Once the list is created, you will learn how to traverse it efficiently to display elements, count nodes, and understand how linked list traversal differs from array traversal. Every concept is explained step by step with practical coding demonstrations, clear illustrations, and hands-on examples to make learning easy and engaging.

By the end of this course, you will be able to confidently create and traverse singly linked lists in C, understand their underlying concepts, and build a solid foundation for learning advanced linked list operations and other data structures.

Who this course is for:

  • Beginners who want to understand singly linked lists from the ground up.

Report abuse