Transcription of Linked List Problems - Stanford University
{{id}} {{{paragraph}}}
Example: bankruptcy
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.
4 Use of the Basic Utility Functions This sample code demonstrates the basic utility functions being used. Their implementations are also given in the appendix at the end of the document.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: