Editing Linked list (section)

===Doubly linked list===
{{Main|Doubly linked list}}
In a 'doubly linked list', each node contains, besides the next-node link, a second link field pointing to the 'previous' node in the sequence. The two links may be called 'forward('s') and 'backwards', or 'next' and 'prev'('previous').

[[Image:Doubly-linked-list.svg|frame|center|A doubly linked list whose nodes contain three fields: an integer value, the link forward to the next node, and the link backward to the previous node]]

A technique known as [[XOR linked list|XOR-linking]] allows a doubly linked list to be implemented using a single link field in each node. However, this technique requires the ability to do bit operations on addresses, and therefore may not be available in some high-level languages.

Many modern operating systems use doubly linked lists to maintain references to active processes, threads, and other dynamic objects.<ref name=":0">{{cite web|url=http://www.osronline.com/article.cfm?article%3D499 |title=The NT Insider:Kernel-Mode Basics: Windows Linked Lists |access-date=2015-07-31 |url-status=dead |archive-url=https://web.archive.org/web/20150923015150/http://www.osronline.com/article.cfm?article=499 |archive-date=2015-09-23 }}</ref> A common strategy for [[rootkits]] to evade detection is to unlink themselves from these lists.<ref>{{cite web |last=Butler |first=Jamie |last2=Hoglund |first2=Greg |title=VICE – Catch the hookers! (Plus new rootkit techniques) |url=https://www.cs.dartmouth.edu/~sergey/me/cs/cs108/rootkits/bh-us-04-butler.pdf |url-status=dead |archive-url=https://web.archive.org/web/20161001201702/https://www.cs.dartmouth.edu/~sergey/me/cs/cs108/rootkits/bh-us-04-butler.pdf |archive-date=2016-10-01 |access-date=2021-08-31}}</ref>