CSCI-1200 Computer Science II — Spring 2006
Lecture 20 Linked Lists — Part I
Review from Lecture 19 and Lab
•Building our own version of vector,stack &queue
•Templates
•Classes that allocate dynamic memory really must provide the BIG 3:
–Copy constructor
–Assignment operator
–Destructor
•Dynamic resizing
Today’s Class: Linked Lists Part I
•Motivation: implementation of the std::list container class.
•Introductory example on linked lists.
•Basic linked list operations:
–Stepping through a list
–Push back
–Insert
–Remove
•Common mistakes
20.1 Motivation
•Thus far our discussion of how list<T> is implemented has been only intuitive: it is a “chain” of objects.
•Now we will look at the mechanism — linked lists.
•Learning this mechanism is good background for higher-level courses where the design of novel data structures
is important.
20.2 Objects with Pointers / Linking Objects
•The two fundamental mechanisms of linked lists are:
–creating objects with pointers as one of the member variables, and
–making these pointers point to other objects of the same type.
•These mechanisms are illustrated in the following program:
#include <iostream>
using namespace std;
template <class T>
class Node {
public:
T value;
Node* ptr;
};
