I know I didnt answer the question about a "linked list". I
thought it would be better if I just forget about linked lists
because it is an abstract data type that is often implemented
in the C/C++ programming language.

Basically, a "linked list" is a set of data structures or "nodes"
that is in sequence; ie, the list has a beginning (i.e "head") and
and an end (i.e "tail"). Each node contains data, in addition
to a "next" pointer which points to the next node in the list.

Below is a text/graphical depiction of a linked list with
6 nodes. H is the head node, T is the tail node, and all
the other nodes are marked as N. Each node has an
arrow or pointer which points to the next node.

[H]--[N]--[N]--[N]--[N]--[T]

The nice thing about linked lists is that you can make them
dynamically grow or shink, by adding or deleting nodes.
So, a linked list is ALMOST like an array. The main difference
is that an array size is usually fixed, but a linked list can
dynamically grow and new nodes can be inserted anywhere
in the middle of the list.

Is this really your first experience with linked lists??


"GS" wrote in message
...

That's a bit more helpful but doesn't answer my Q about a 'linked list'.