Editing XOR linked list (section)

{{Short description|Datastructure}}
{{More citations needed|date=October 2009}}

An '''XOR linked list''' is a type of [[data structure]] used in [[computer programming]]. It takes advantage of the [[Bitwise operation#XOR|bitwise XOR]] operation to decrease storage requirements for [[doubly linked list]]s by storing the composition of both addresses in one field. While the composed address is not meaningful on its own, during traversal it can be combined with knowledge of the last-visited node address to deduce the address of the following node.