Linked List in F#
Implement a doubly linked list
exercism fetch fsharp linked-list
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
shift will never be called on an
If you want to know more about linked lists, check Wikipedia.
A doubly linked list is a mutable data structure. As F# is a functional-first language, immutability is generally preferred, but there are language features that allow the use of mutation where it is required.
mutablekeyword can be placed before
letbindings and record fields, allowing you to assign new values to them.
Class properties can be made mutable by specifying a property setter with the
Mutable bindings must be re-assigned with
Classic computer science topic
Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.