Previous topic |
Next topic |
Ada Home Page |
Index
Linked List
A linked list is a sequence of nodes
- each node is linked to the one following
- last one has a null link
- List head pointer refers to start of list
Linked List Operations
Standard list operations, regardless of type of data stored
- initialise empty list
- insert node at beginning of list
- insert node at end of list
- insert in order
- find node that contains given value
- print out contents of list
- delete record
- count nodes
Code for several of
these operations shows how access types and variables are
most commonly used.
A linked list is a good example of an
abstract data type.
Previous topic |
Next topic |
Ada Home Page |
Index
c-lokan@adfa.oz.au / 27 Feb 96