2. Coding for Linked Lists

2. Coding for Linked Lists

2. Coding for Linked Lists

2.1. Utils, not ADTs
2.2. Example:Using the LListHeader
2.3. Traversing a Linked List
2.4. Searching a Linked List
2.5. Adding to a Linked List
2.6. Removing from a Linked List
2.7. Copying and Clean-up

We need two data types to build a linked list:

```
template <typename Data>
struct LListNode
{
  Data data;
  LListNode<Data>* next;

  LListNode() {next = 0;}
  LListNode 
    (const Data& d, 
     LListNode<Data>* nxt = 0)
    : data(d), next(nxt)
  {}
};
```
The linked list node
- I'm doing this as a template so it can be easily re-used
- The actual kind of data stored is not particularly important

template <typename Data>
struct LListHeader {

  LListNode<Data>* first;

  LListHeader();
   ⋮
};

The header for the entire linked list


1.3. Removing from Linked Lists	\| \|	2.1. Utils, not ADTs