Linked Lists: Python

With the `Node` in hand, we can start building the actual linked list. Depending on the end-use of the linked list, a variety of methods can be defined.

For our use, we want to be able to:
- get the head node of the list (it's like peeking at the first item in line)
- add a new node to the beginning of the list
- print out the list values in order
- remove a node that has a particular value

Let's get started!

**Note:** Because the workspace is set up with spaces instead of tabs, you will need to use spaces to prevent Python from throwing an error. You can learn more about this [here](https://www.python.org/dev/peps/pep-0008/#tabs-or-spaces).

Linked List Implementation I

Nice! Now we have a bunch of helpful `LinkedList` methods under our belt. 

The final use case we mentioned was the ability to remove an arbitrary node with a particular value. This is slightly more complex, since a couple of special cases need to be handled. 

Consider the following list:
```
a -> b -> c
```
If node `b` is removed from the list, the new list should be:
```
a -> c
```

We need to update the link within the `a` node to match what `b` was pointing to prior to removing it from the linked list.

Lucky for us, in Python, nodes which are not referenced will be removed for us automatically. If we take care of the references, `b` will be "removed" for us in a process called <a href="https://en.wikipedia.org/wiki/Garbage_collection_(computer_science)" target="_blank">Garbage Collection</a>. 

For the purposes of this lesson, we'll create a function that removes the _first_ node that contains a particular value. However, you could also build this function to remove nodes by index or remove all nodes that contain a particular value.

Linked List Implementation III

Congratulations, you have implemented a linked list in Python!

We did this by:
- Defining a `Node` class to hold the values and links between nodes
- Implementing a `LinkedList` class to handle external operations on the list like adding and removing nodes


Linked List Review

So far we can: 
- create a new `LinkedList` using `.__init__()`
- get the head node of the list using `.get_head_node()`

Next up, we'll define methods for our `LinkedList` class that allow us to:
- insert a new head node
- return all the nodes in the list as a string so we can print them out in the terminal!

Linked Lists Implementation II

Let's implement a linked list in Python. As you might recall, each linked list is a sequential chain of nodes. So before we start building out the `LinkedList` itself, we want to build up a `Node` class in Python that we can use to build our data containers.

Remember that a node contains two elements:
- data
- a link to the next node

Ready? Let's get started!


**Note:** Because the workspace is set up with spaces instead of tabs, you will need to use spaces to prevent Python from throwing an error. You can learn more about this [here](https://www.python.org/dev/peps/pep-0008/#tabs-or-spaces).