Sha256: 3d3d2f890b778d4c0bb1c20cda21ab762b15b074ee6dcb6a44751c85d9dd8a01
Contents?: true
Size: 1.61 KB
Versions: 74
Compression:
Stored size: 1.61 KB
Contents
# Simple Linked List Write a simple linked list implementation that uses Elements and a List. The linked list is a fundamental data structure in computer science, often used in the implementation of other data structures. They're pervasive in functional programming languages, such as Clojure, Erlang, or Haskell, but far less common in imperative languages such as Ruby or Python. The simplest kind of linked list is a singly linked list. Each element in the list contains data and a "next" field pointing to the next element in the list of elements. This variant of linked lists is often used to represent sequences or push-down stacks (also called a LIFO stack; Last In, First Out). As a first take, lets create a singly linked list to contain the range (1..10), and provide functions to reverse a linked list and convert to and from arrays. When implementing this in a language with built-in linked lists, implement your own abstract data type. ## Hints This exercise requires you to create a linked list data structure which can be iterated. This requires you to implement the IEnumerable\<T> interface. For more information, see [this page](https://msdn.microsoft.com/en-us/library/9eekhta0(v=vs.110).aspx). ## Source Inspired by 'Data Structures and Algorithms with Object-Oriented Design Patterns in Ruby', singly linked-lists. [http://www.brpreiss.com/books/opus8/html/page96.html#SECTION004300000000000000000](http://www.brpreiss.com/books/opus8/html/page96.html#SECTION004300000000000000000) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
74 entries across 74 versions & 1 rubygems