Transcription of Linked List Problems - Stanford University
{{id}} {{{paragraph}}}
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 linked list problems. The first few are basic. The last few are only necessary for the more advanced problems. 1. Iterate Down a List A very frequent technique in linked list code is to iterate a pointer over all the nodes in a list. Traditionally, this is written as a while loop. The head pointer is copied into a local
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}