Sha256: c1bf6c40da67eef234749edf955b594a7c83448fe9588ac78f7834f78c829e25
Contents?: true
Size: 859 Bytes
Versions: 174
Compression:
Stored size: 859 Bytes
Contents
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.
Version data entries
174 entries across 174 versions & 1 rubygems