Linked List Problems - Stanford University

Linked List Problems By Nick Parlante Copyright 1998-2002, Nick Parlante Abstract This document reviews basic Linked list code techniques and then works through 18. Linked list Problems covering a wide range of difficulty. Most obviously, these Problems are a way to learn about Linked lists . More importantly, these Problems are a way to develop your ability with complex pointer algorithms. Even though modern languages and tools have made Linked lists pretty unimportant for day-to-day programming, the skills for complex pointer algorithms are very important, and Linked lists are an excellent way to develop those skills. The Problems use the C language syntax, so they require a basic understanding of C and its pointer syntax. The emphasis is on the important concepts of pointer manipulation and Linked list algorithms rather than the features of the C language.

3. Build — At Head With Push() The easiest way to build up a list is by adding nodes at its "head end" with Push(). The code is short and it runs fast — lists naturally support operations at their head end. The disadvantage is that the elements will appear in the list in the reverse order that they are added.

Tags:

  Lists, Problem, Fast, Push, Linked, Linked list problems

Information

Related search queries