Introduction to Linked Lists

CS 106B: Programming Abstractions

Spring 2022, Stanford University Computer Science Department
Lecturer: Chris Gregg, Head CA: Neel Kishnani

Slide 2

Announcements
Assignment 5 is due Friday

Slide 3

Today's Topics
Structs and pointers
Can you architect a queue?
Let's do it with a Vector
Let's try it with links
Introduction to the Linked List data structure
The Node struct
Lord of the Linked Lists
How is the Stack implemented with a linked list?
Linked List Queue implementation

Slide 4

Using pointers with class and struct objects

Let's define a class (or it could be a struct) as follows:
 class Date {
public:
int day;
int month;
int year;
string dayOfWeek;
int daysInMonth();
};

Pate d Array new Date7

Pointers can point to a class or struct just like they can to any other variable:

Date* dPtr = new Date; // we now have a pointer to a Date object

If we want to access the class variables and functions, we could do this:

(*dPtr).day = 7; dPtrdereference thepointer

int numDays = (*dPtr).daysInMonth();
Don't use distrday it will

I
cout << (*dPtr).month << endl;
toevaluate
same try
But, this notation is cumbersome, and the parentheses are necessary becasue the "dot" has a higher dptrdaytis
precedence than the *. which iswrong
So, there is a di!erent, more intuitive syntax, called the arrow syntax: ->

dPtr->day = 7; However
if we havean
away
Date d 7
int numDays = dPtr->daysInMonth();
cout << dPtr->month << endl; Array new Date
Then we can use dArrayto moth
Arrow notation, x->var is equivalent to (*x).var, and we will use it exclusively when using classes and

Woeste
structs.
referencefor
Slide 5
y

Can you architect a queue?

Let's investigate building a queue from a Vector
The following class definition for an integer queue would su!ice for the enqueue and dequeue functions,
with a Vector holding the data.

class QueueInt { // in QueueInt.h

public:
QueueInt (); // constructor

void enqueue(int value); // append a value

int dequeue(); // return the first-in value

private:
Vector<int> data; // member variables
};

Let's assume that we have the back of the queue on the le", and the front of the queue on the right. If we
enqueue eight values, the vector would look like this:
 back front
↓ ↓
1 2 3 4 5 6 7 8

The dequeue operation is relatively straightforward: we just remove and return the element from the end,
and the front is now at the previous index:

back front
↓ ↓
1 2 3 4 5 6 7 _

But, enqueue is more involved. Because the back is on the le! of the vector, we have to move all the
elements over one, one at at time before placing our value into the vector. If we enqueue(9) on the
vector, this is what happens:

1 2 3 4 5 6 7 7
1 2 3 4 5 6 6 7
1 2 3 4 5 5 6 7
1 2 3 4 4 5 6 7
1 2 3 3 4 5 6 7
1 2 2 3 4 5 6 7
1 1 2 3 4 5 6 7
9 1 2 3 4 5 6 7

If we look at the complexity of enqueue() and dequeue(), we have:

enqueue: O(n)
dequeue: O(1)

Slide 6

And Now for Something Completely Di"erent

Let's use pointers to make things a bit more interesting.
Let's say that we have an 8 that we want to put into a queue. We can make a variable that holds an 8, and
let's say we do this with dynamic memory.
Now, let's say we have a data pointer that points to an integer. In this case, it will point to the 8. We now
have a queue! The front of the queue is the 8, as is the back of the queue.

Now, what if we want to enqueue(7) into the queue? Well, we can create a 7 just like we created the 8.
What if we simply put a 7 somewhere in memory, and then changed data to point to the 7, and made the
7 (somewhow) point to the 8? (The somehow, by the way, is a pointer that is associated with the 7 called
its next pointer, in a struct – we will get to that!).

Now we have enqueued the 7 into the back of the queue! Our data points to the 7, which we have
"pointed" to the 8.
Let's enqueue(6), and go through the process a bit slower.
Now we have a 6 in memory, but not yet connected to anything. We must get data to point to the 6, and
then have the 6 point to the 7. We actually first point the 6 to the 7. It turns out that if we didn't do that, It
turns out that we have to do it in this order becuase if we changed data first, we would lose access to the
7, becuase data was the only thing pointing to the 7 (we'll cover this soon!)

Remember, two pointers can point to the same value (in this case, both data and the 6 pointer).
Next, we can change data to point to the 6:
 Oh, look, we've enqueued the 6!
There are two bits of extra information that we need to make this list a proper queue
We need to figure out what 8 points to. In this case, we will point 8 to nullptr, indicating that it is
the end of the list. If we check 8's pointer and find that it is nullptr, then we are at the end of the
list (or, in this case, the front of the queue). In the diagram, we just represent this with a slash
through 8's pointer region.
We need to designate the front as such, and the back as such:

It turns out that this is the wrong way to build a queue with a linked list! We'll see at the end of the lecture
a better way to do it by changing things just a bit.

Slide 7

Linked Lists
What we've just examined is the beginning of a linked list
A linked list is a chain of nodes
 Each node contains two pieces of information:
Some piece of data that is stored in the sequence
A link to the next node in the list
We can traverse the list by starting at the first node and repeatedly following its link.

Each element is stored separately from the rest.

The elements are then chained together into a sequence.

To add a node at the end, we chain the last element to the end, by first finding the end (traversing the
list), and then adding it:

Slide 8

Adding a node in the middle of a linked list

To insert a node into the middle of a linked list, we first need to find the location where we are adding it –
this can be a slow process because we have to travers from the beginning!
Let's say we want to insert between 2 and 3. First, we need to find 2 by traversing from 1, and then we
split the list and insert our new element:
Slide 9

Removing a node in the middle of a linked list

To remove a node into the middle of a linked list, we first need to find the location where we are adding it,
as with insert.
Let's say we want to remove 3. First, we need to find 100 by traversing from 1, then 2, and then to 100.
Then, we rewire the list so 100 points to 4:

Need to
keeptrack of loo'snextpointer
Slide 10
because once we've arrived at 3 we cannot
back totoo's pointer
come anymore
Why linked lists?
We can e"iciently splice new elements into the list or remove existing elements anywhere in the list
We never have to do a massive copy step
Linked lists have many tradeo"s, and are not o!en the best data structure!

Slide 11

Linked lists in C++

Let's take a look at building a linked list of strings
In C++, we represent the node in the linked list as a struct, with two fields, a data field, and a next field:

struct Node {
string data;
/* ? */ next;

But, what is the type of next? It must point to another Node, so…it is a Node* type:

struct Node {
string data;
Node* next;
};

The structure is defined recursively! The compiler can handle the fact that in the definition of the Node
there is a Node*, becuase it knows it is simply a pointer. We could not recursively define the Node with an
 actual Node object inside the struct, as that would be impossible to realize.

Slide 12

Always!
Always draw pictures when you are
building linked lists! This is critical to
getting the hang of it.
Slide 13

Lord of the Linked Lists

In a scene that was brilliantly captured in Peter Jackson’s film adaptation of The Return of the King,
Rohan is alerted to the danger to Gondor by a succession of signal fires moving from mountain top to
mountain top. This scene is a perfect illustration of the idea of message passing in a linked list.

Slide 14

Return of the King

Return of the King clip

Slide 15

Lord of the Linked Lists

We are going to make a San Francisco-based linked list, based on CalTrain stops. Step 1, make the linked
list:

Step 2: Light the fires!

struct Tower {
string name; /* The name of this tower */
Tower* next; /* Pointer to the next tower */
};

Add the first tower:

// add the first tower

Tower * head = new Tower;
head->name = "San Jose";
head->next = nullptr;

The main function:

// main head is a Towerpointer IpointerpointstoTower

It is not a Tower object
Tower * head = new Tower;
head->name = "San Jose";
head->next = nullptr;
Stack Heap
head = createTower("Santa Clara", head);

head
late III
head = createTower("Mountain View", head);
head = createTower("Palo Alto", head);

DI
head = createTower("Menlo Park", head); changes
head = createTower("Redwood City", head);
to
TEJ
head = createTower("Millbrae", head);
head = createTower("Bayshore", head);
head = createTower("San Francisco", head);

The createTower function:

Tower* createTower(string name, Tower *next) {

Tower* tp = new Tower;
tp->name = name;
tp->next = next;
return tp;
}

The signal function (which is recursive!):

void signal(Tower* start) {

if (start != nullptr) {
cout << "Lighting " << start->name << endl;
signal(start->next);
}
}
 We call the function with the head:

signal(head);

By the way: the head pointer is not a Tower! it is only a pointer to a Tower, and the first Tower is San

Francisco.

Slide 16

How is the Stack implemented with a linked

list?
 The Node definition we've seen before:

struct Node {
int data;
Node *next;
};

Slide 17

Stack
Let's assume we have the following stack already, with 8 at the top, and 9 below 8. We then want to
push(7) onto the stack:

Here is our goal:

Our first attempt at push(7):

Node* temp = new Node;

temp->data = 7;

If we try to rewire by changing head first…

head = temp;
In other words: a linked list's elements must be pointed to, because we need to keep track of them. In our
attempt above, we've lost access to the 8, becuase the only thing pointing at the 8 was head. If we
reassign head to point to another object (the 7 in this case), we've broken the chain and lost 8. This is a
common bug!
Let's try again:

Here is our goal:

Our next attempt at push(7):

Node* temp = new Node;

temp->data = 7;

Now we rewire 7's next pointer first:

 temp->next = head;

You might be thinking, wait – why didn't the arrow go from the 7 to the head? – this is a common
misconception of what is happening!
Remember, head is not a Node. head is a pointer to a Node. Notice that head does not have a next –
it's not an object, just a pointer.
The statement temp->next = head; says, "give 7's next pointer the same data as head", which is
what we want to do.
Now, we are able to reassign head to point to the 7, and we will have a correct linked list with 7 pushed

onto the top:

Our temp pointer actually disappears when the push operation is complete (it goes out of scope), so we
are le! with the following:
Slide 18

Stack pop()
To pop a data from our stack, we start like this:

int toReturn = head->data;

What if we tried this to reassign head?

head = head->next;

This is a bug! Our linked list is fine, but we have a memory leak! We have le! the 7 in memory and not
returned it to the operating system with delete.
Instead, we need to do this:

Node* temp = head;

Now we can reassign head:

head = head->next;

Because we still have access to the 7, we can return the memory to the operating system:

delete temp;

Finally, we return the data, and temp goes out of scope:

return toReturn;
Slide 19

Stack Code
Header, intStack.h:

#pragma once

class IntStack {
public:
IntStack(); // constructor
~IntStack();

bool isEmpty();

void push(int value);

int top();
int pop();

private:
struct Node {
int data;
Node* next;
};

Node* head;
};

Class code, intStack.cpp

 #include "intStack.h"

IntStack::IntStack()
{
head = nullptr;
}

IntStack::~IntStack()
{
while (head != nullptr) {
Node *temp = head;
head = head->next;
delete temp;
}
}

void IntStack::push(int value)

{
Node* node = new Node;

node->data = value;
node->next = head;

head = node;
}

int IntStack::pop()
{
if (isEmpty()) {
throw "Error! Trying to pop from empty stack!";
}

int toReturn = head->data;

Node* temp = head;

head = head->next;

delete temp;
return toReturn;
}

Slide 20

A Better Linked List Queue

At the beginning of this topic, we discussed how to build a queue with a linked list. We had the back as
the first element in the list, and the front as the second element. This led to O(1) behavior for enqueue,
and O(n) behavior for dequeue. We can do better!
If we hold a pointer to the front and to the back, and we make the front the first element in the list, and
 the back the last element in the list, we can successfully make a queue with O(1) behavior for both
enqueue and dequeue.
Here is the code, then we'll walk through some examples:
intQueue.h

#pragma once

class IntQueue {
public:
IntQueue(); // constructor
~IntQueue();

bool isEmpty();

void enqueue(int value);

int front();
int dequeue();

private:
struct Node {
int data;
Node* next;
};

Node* _front;
Node* _back;
};

intQueue.cpp:

#include "intQueue.h"

IntQueue::IntQueue()
{
_front = nullptr;
_back = nullptr;
}

IntQueue::~IntQueue()
{
while (_front != nullptr) {
Node *temp = _front;
_front = _front->next;
delete temp;
}
}

All course materials © Stanford University 2021

void IntQueue::enqueue(int value)
Website programming by Julie Zelenski • Styles adapted from Chris Piech • This page last updated 2022-May-10
{
Node* node = new Node;
 node->data = value;
node->next = nullptr;

if (_back == nullptr) { // enqueue on empty queue

_front = node;
_back = node;
} else {
_back->next = node;
_back = node;
}
}

int IntQueue::dequeue()
{
if (isEmpty()) {
throw "Error! Trying to dequeue from empty queue!";
}

int toReturn = _front->data;

Node* temp = _front;

_front = _front->next;

if (_front == nullptr) {
_back = nullptr; // empty queue
}

delete temp;
return toReturn;
}

bool IntQueue::isEmpty()
{
return _front == nullptr;
}

int IntQueue::front()
{
return _front->data;
}