This is the third in a series of videos about the linked list data structure. It describes an algorithm for adding new data items to a linked list in terms of list traversal and Next pointer manipulation. A description of some procedural pseudocode to perform this task is also included, which could be adapted to implement a linked list programmatically.