XOR linked list - Wikipedia

CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed. (October 2009) ( Learn how and when to remove this template message ) An XOR linked list is a data structure used in computer programming . It takes advantage of the bitwise XOR operation to decrease storage requirements for doubly linked lists . 1 Description 1.1 Theory of operation 2 Features 3 Drawbacks 4 Variations 4.1 Addition linked list 4.2 Subtraction linked list 5 See also 6 References 7 External links Description [ edit ] An ordinary doubly linked list stores addresses of the previous and next list items in each list node, requiring two address fields: ... A B...

Linked on 2016-12-05 23:36:21 | Similar Links