Linked lists are a sequential data structure. A linked list consists of nodes which store data and a link to another node. Each node knows its location, what value it holds, and where to find the n…

Start by extending the functionality of the […] class. Write a method to insert a node anywhere in the linked list based on an input number. […] means inserting at the head, […] is the …

For our second problem, we’ll continue extending our […] class. Write a method which returns the node that is […] nodes from the tail of the linked list. If […] is […] , we wou…

Our next problem assumes a sorted linked list. Nodes held at […] will have values greater than or equal to the current node’s value. Write a method on the […] class which removes all dupli…

The next problem involves working with two different linked lists. You’ll need to write a function outside of the […] class. Given two sorted linked lists as input, your function should retu…

Nodes within a linked list can be referenced multiple times. We’ll explore this idea with a partially merged linked list. […] In this example, two different heads (nodes holding […] and …

What if instead of progressing through nodes from head to tail, we wanted to move from tail to head? We can reverse a linked list to make this the default traversal! Let’s examine what we’ll need …

As we saw with the merge point problem, more than one node can reference another node. These references can create a cycle in the linked list where the traversal will loop back on itself. […]…

For our last problem, we’re going to pretend that each node in a linked list holds the digit of a number. The tail node holds the most significant digit and the head node holds the least significan…

Linked lists are a sequential data structure like lists, but they store data in a different way. Lists store data sequentially in the computer’s memory. Linked lists track the internal memory addre…