Search results

Page title matches

• Linked list
  ...equence. Such a list which linked both forwards and backwards is a doubly-linked list. ...the [[node]], and a [[pointer]] to the next node in the list. In a doubly linked list, each [[node]] also contains a [[pointer]] to the previous node in the list
  2 KB (422 words) - 16:03, 30 July 2009
• Linked list/Definition
  154 bytes (24 words) - 21:54, 30 October 2009
• Linked list/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Linked list]]. Needs checking by a human.
  522 bytes (70 words) - 18:06, 11 January 2010

Page text matches

• Linked list
  ...equence. Such a list which linked both forwards and backwards is a doubly-linked list. ...the [[node]], and a [[pointer]] to the next node in the list. In a doubly linked list, each [[node]] also contains a [[pointer]] to the previous node in the list
  2 KB (422 words) - 16:03, 30 July 2009
• Chain (disambiguation)
  {{rpl|Linked list}}
  178 bytes (23 words) - 02:35, 25 September 2013
• Locality of reference/Related Articles
  {{r|Linked list||**}}
  296 bytes (36 words) - 08:57, 15 September 2009
• Linked list/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Linked list]]. Needs checking by a human.
  522 bytes (70 words) - 18:06, 11 January 2010
• Data structure/Related Articles
  {{r|Linked list}}
  566 bytes (76 words) - 15:51, 11 January 2010
• Stack
  ...mentations of a stack ADT, and instead encourage the programmer to use the linked list ADT. ** [[linked list|linked lists]]
  3 KB (537 words) - 00:36, 9 February 2010
• Data structure
  ...trieved from sets with not necessarily unique elements. Examples include [[linked list|lists]], [[set|sets]] and some [[tree|trees]]. ...ement thus on the average requires ''length_of_list''/2 accesses. [[Double-linked list]]s provide links in both directions of the list so that the previous node c
  7 KB (1,246 words) - 17:24, 31 July 2008
• Locality of reference
  ...sted in the index structure but not the indexed content. Thus traversing a linked list to find its tail or following all references in memory to detect unreachabl
  4 KB (634 words) - 04:17, 9 March 2010
• Hash table
  ...n as ''bucket hashing'')---by far, the simplest---stores an [[array]] of [[linked list|linked lists]] of value elements. If two keys have the same hash value, th
  5 KB (832 words) - 13:00, 16 January 2008
• Lisp
  ...ne of its prominently featured [[data structure|data structures]] is the [[linked list]]. Lisp is still used, and sometimes taught, in universities, and has had '''Analysis.''' The defining data type of Lisp is the ''linked list''. A list is written between parentheses, with spaces to separate elements.
  9 KB (1,405 words) - 08:29, 2 March 2024
• Forwarding information base
  ...outers usually organized the FIB as a hash table, while the RIB might be a linked list. Depending on the implementation, the FIB might have fewer entries than the
  12 KB (1,828 words) - 16:22, 30 March 2024
• NoSQL
  {{Image|Linked list data format.jpg|right|400px|In a linked list data format, each record has one piece of information; the second piece poi ...cords immediately before and immediately after the altered record. Usually linked list data structures had an extra record at the beginning and end of the list ca
  46 KB (7,002 words) - 07:32, 18 September 2010
• Archive:Citizen/V1-N2
  * [[Linked list]]
  25 KB (3,396 words) - 13:29, 2 April 2024