Implement a doubly linked list.
Like an array, a linked list is a simple linear data structure. Several common data types can be implemented using linked lists, like queues, stacks, and associative arrays.
A linked list is a collection of data elements called nodes. In a singly linked list each node holds a value and a link to the next node. In a doubly linked list each node also holds a link to the previous node.
You will write an implementation of a doubly linked list. Implement a Node to hold a value and pointers to the next and previous nodes. Then implement a List which holds references to the first and last node and offers an array-like interface for adding and removing items:
push
(insert value at back);pop
(remove value at back);shift
(remove value at front).unshift
(insert value at front);To keep your implementation simple, the tests will not cover error
conditions. Specifically: pop
or shift
will never be called on an
empty list.
If you want to know more about linked lists, check Wikipedia.
To run the tests, run the command dotnet test
from within the exercise directory.
Initially, only the first test will be enabled. This is to encourage you to solve the exercise one step at a time.
Once you get the first test passing, remove the Skip
property from the next test and work on getting that test passing.
Once none of the tests are skipped and they are all passing, you can submit your solution
using exercism submit LinkedList.cs
For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io C# language page.
Classic computer science topic
using Xunit;
public class DequeTests
{
[Fact]
public void Push_and_pop_are_first_in_last_out_order()
{
var deque = new Deque<int>();
deque.Push(10);
deque.Push(20);
Assert.Equal(20, deque.Pop());
Assert.Equal(10, deque.Pop());
}
[Fact(Skip = "Remove this Skip property to run this test")]
public void Push_and_shift_are_first_in_first_out_order()
{
var deque = new Deque<int>();
deque.Push(10);
deque.Push(20);
Assert.Equal(10, deque.Shift());
Assert.Equal(20, deque.Shift());
}
[Fact(Skip = "Remove this Skip property to run this test")]
public void Unshift_and_shift_are_last_in_first_out_order()
{
var deque = new Deque<int>();
deque.Unshift(10);
deque.Unshift(20);
Assert.Equal(20, deque.Shift());
Assert.Equal(10, deque.Shift());
}
[Fact(Skip = "Remove this Skip property to run this test")]
public void Unshift_and_pop_are_last_in_last_out_order()
{
var deque = new Deque<int>();
deque.Unshift(10);
deque.Unshift(20);
Assert.Equal(10, deque.Pop());
Assert.Equal(20, deque.Pop());
}
[Fact(Skip = "Remove this Skip property to run this test")]
public void Push_and_pop_can_handle_multiple_values()
{
var deque = new Deque<int>();
deque.Push(10);
deque.Push(20);
deque.Push(30);
Assert.Equal(30, deque.Pop());
Assert.Equal(20, deque.Pop());
Assert.Equal(10, deque.Pop());
}
[Fact(Skip = "Remove this Skip property to run this test")]
public void Unshift_and_shift_can_handle_multiple_values()
{
var deque = new Deque<int>();
deque.Unshift(10);
deque.Unshift(20);
deque.Unshift(30);
Assert.Equal(30, deque.Shift());
Assert.Equal(20, deque.Shift());
Assert.Equal(10, deque.Shift());
}
[Fact(Skip = "Remove this Skip property to run this test")]
public void All_methods_of_manipulating_the_deque_can_be_used_together()
{
var deque = new Deque<int>();
deque.Push(10);
deque.Push(20);
Assert.Equal(20, deque.Pop());
deque.Push(30);
Assert.Equal(10, deque.Shift());
deque.Unshift(40);
deque.Push(50);
Assert.Equal(40, deque.Shift());
Assert.Equal(50, deque.Pop());
Assert.Equal(30, deque.Shift());
}
}
using System;
public class Deque<T>
{
private class Node
{
public T Value { get; }
public Node Next { get; set; }
public Node Prev { get; set; }
public Node(T value, Node next = null, Node prev = null)
{
Value = value;
Next = next;
Prev = prev;
}
}
private Node First { get; set; }
private Node Last { get; set; }
public void Push(T value)
{
var newNode = new Node(value);
if (IsEmpty())
{
First = Last = newNode;
}
else
{
newNode.Prev = Last;
Last.Next = newNode;
Last = newNode;
}
}
public T Pop()
{
if (IsEmpty()) throw new InvalidOperationException();
var remove = Last;
if (HasOneItem())
{
First = Last = null;
}
else
{
Last = Last.Prev;
Last.Next = null;
}
remove.Prev = null;
return remove.Value;
}
public void Unshift(T value)
{
var newNode = new Node(value, First);
if (IsEmpty())
{
First = Last = newNode;
}
else
{
newNode.Next = First;
First.Prev = newNode;
First = newNode;
}
}
public T Shift()
{
if (IsEmpty()) throw new InvalidOperationException();
var remove = First;
if (HasOneItem())
{
First = Last = null;
}
else
{
First = First.Next;
First.Prev = null;
}
remove.Next = null;
return remove.Value;
}
public bool IsEmpty() => First == null && Last == null;
private bool HasOneItem() => First == Last && First != null;
}
A huge amount can be learned from reading other peopleâ€™s code. This is why we wanted to give exercism users the option of making their solutions public.
Here are some questions to help you reflect on this solution and learn the most from it.
Level up your programming skills with 3,443 exercises across 52 languages, and insightful discussion with our volunteer team of welcoming mentors. Exercism is 100% free forever.
Sign up Learn More
Community comments