XOR Linked List is the memory efficient version of Doubly Linked List because it makes use of only one space for address field with every node.
An ordinary doubly linked list stores addresses of the previous and next list items in each list node, requiring two address fields to be maintained per node.
Read this article to understand XOR Linked List in depth
Have a doubt or thought? Join the discussion now
This is a companion discussion topic for the original entry at http://iq.opengenus.org/xor-linked-list/