Linked List Basics - Stanford University

Linked ListBasicsBy Nick ParlanteCopyright 1998-2001, Nick ParlanteAbstractThis document introduces the basic structures and techniques for building Linked listswith a mixture of explanations, drawings, sample code, and exercises. The material isuseful if you want to understand Linked lists or if you want to see a realistic, appliedexample of pointer-intensive code. A separate document, Linked List Problems( ), presents 18 practice problems covering a wide rangeof lists are useful to study for two reasons. Most obviously, Linked lists are a datastructure which you may want to use in real programs. Seeing the strengths andweaknesses of Linked lists will give you an appreciation of the some of the time, space,and code issues which are useful to thinking about any data structures in less obviously, Linked lists are great way to learn about pointers. In fact, youmay never use a Linked list in a real program, but you are certain to use lots of list problems are a nice combination of algorithms and pointer , Linked lists have been the domain where beginning programmers get thepractice to really understand article assumes a basic understanding of programming and pointers.

memory allocator, so it is becoming less common that source code needs to explicitly check for allocation failures. • free() free() is the opposite of malloc(). Call free() on a block of heap memory to indicate to the system that you are done with it. The argument to free() is a pointer to a block of memory in the heap — a pointer which

Loading..

Tags:

  Memory

Information

Related search queries