Doubly-linked list/Definition

From Rosetta Code
< Doubly-linked list
Revision as of 06:15, 25 December 2008 by rosettacode>Grauenwolf (New page: {{task|Data Structures}} Define the data structure for a complete doubly-linked list. * The structure should support adding elements to the head, tail and middle o...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Task
Doubly-linked list/Definition
You are encouraged to solve this task according to the task description, using any language you may know.

Define the data structure for a complete doubly-linked list.

  • The structure should support adding elements to the head, tail and middle of the list.
  • The structure should not allow circular loops
Retrieved from "https://rosettacode.org/wiki/Doubly-linked_list/Definition?oldid=94594"