O'Reilly logo

Advanced Topics in C: Core Concepts in Data Structures by Noel Kalicharan

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

CHAPTER 4

image

Linked Lists

In this chapter, we will explain the following:

  • The notion of a linked list
  • How to write declarations for working with a linked list
  • How to count the nodes in a linked list
  • How to search for an item in a linked list
  • How to find the last node in a linked list
  • The difference between static storage and dynamic storage allocation
  • How to allocate and free storage in C using malloc, calloc, sizeof, and free
  • How to build a linked list by adding a new item at the end of the list
  • How to insert a node into a linked list
  • How to build a linked list by adding a new item at the head of the list
  • How to delete items from a linked list ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required