#include <LinkedLists.h>
Collaboration diagram for Node:

Data Fields | |
| Node * | next |
The only thing that is assumed with the use of this function is that any structure that you want to use for a linked list node (whatever is the actual contents) starts with a pointer to the next node.
Definition at line 46 of file LinkedLists.h.
|
|
Definition at line 48 of file LinkedLists.h. Referenced by ApplyIndirectOnSimple(), DestroyLinkedList(), FindAndList(), FindAndMoveOut(), FindLast(), GetNthNode(), InvertList(), LeftNodeRight(), SplitAndMergeSort(), and SplitAtNth(). |
1.2.12 written by Dimitri van Heesch,
© 1997-2001