Next:
Handy but not Necessary
Up:
Structured Programming in Pascal
Previous:
The Loop
Contents
Advanced Discussion
Subsections
Handy but not Necessary Constructs
for
case
Recursion
Call Frame
Self-Similar Patterns
Factorial
Recursive Function
Tracing Recursion
Demystifying Recursion
Assignment (Extra Credit 200 Points)
Dynamically Allocated Memory and Pointers
Pointers
Allocating and Deallocating Memory
Practical Use of Pointers
A Linked List
A Link Field
A Linked List
Initializing a Linked List
Check for Empty
Add a Node
Remove a Node
Getting to the Next Node
Reading Records from a File
Scanning a Linked List
Deallocating an Entire Linked List
Tak Auyeung 2003-12-03
