Doubly Linked List

Doubly Linked List

List price: US$45.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes' previous and next links, respectively, point to some kind of terminator, typically a sentinel node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list is circularly linked via the sentinel node. It can be conceptualized as two singly linked lists formed from the same data items, but in opposite sequential orders.show more

Product details

  • Paperback | 60 pages
  • 152 x 229 x 4mm | 100g
  • Fidel
  • United States
  • English
  • 6136615304
  • 9786136615301