Software Engineering Programming Fundamentals

Linked lists for absolute beginners

Learn to juggle with pointers and nodes like any other data structure!
Rating: 4.0 out of 5 (19 ratings)
3,567 students
Created by Sergiu Muresan
Enroll now
Linked lists for absolute beginners
Rating: 4.0 out of 5 (19 ratings)
3,567 students
Buy now
Linked lists structure implementation
Algorithms related to linked lists

Requirements

  • A working computer
  • C/C++ IDE (Visual Studio, Dev-C++, CodeBlocks etc.)
  • Basic understanding of the C language (especially pointers and stack/heap memory)
Description

Learn the basics of linked lists in the C programming language. This course treats the student as a complete beginner to linked lists that has a basic understanding of arrays/pointers and other similar concepts of the C language. What we want is, at the end of this course, for you to be able to use a linked list exactly like a plain old array.

After finishing the course you will be able to

  • Create the data structure for a singly and doubly linked list

  • Insert any element wherever in the linked list

  • Remove an element from the linked list

  • Understand how the linked list is allocated in memory

  • Properly deallocate the linked list

  • And to code other useful algorithms


Who this course is for:
  • Beginner programmers that want to fully understand linked lists and their potential
Curriculum
2 sections • 20 lectures • 3h 25m total length
  • Introduction to linked lists
  • Iterating a linked list
  • Inserting at the end
  • Deallocating (or deleting) a linked list
  • Inserting at the beginning
  • Inserting after a node
  • Inserting in a sorted list
  • Removing an element
  • Basic operations with a linked list
  • Reversing a linked list
  • Detecting cycles/loops
  • Introduction to recursive functions on linked lists, counting number of elements
  • Introduction to doubly linked lists
  • Iterating a doubly linked list
  • Deallocating (or deleting) a doubly linked list
  • Inserting at the beginning
  • Inserting at the end
  • Inserting after a node
  • Removing a node
  • Basic operations with doubly linked lists
  • Finding a node
  • Reversing a doubly linked list

Instructor
Sergiu Muresan
Knowledgeable developer and dedicated teacher
Sergiu Muresan
  • 4.1 Instructor Rating
  • 161 Reviews
  • 7,199 Students
  • 2 Courses

Top graduate at one of the best Universities in Romania. Having noticed the struggle fellow colleagues have been going through to learn new topics, I started pursuing teaching as my main profession.

I have worked on many projects in many of the popular languages and frameworks out there. Having such broad experience from all over the IT field and knowing how to make people understand and learn, I decided to become the go-to person for people that are struggling to learn a new subject.

Life goal: change the education system for the better.