How exactly does a XOR Linked list work?

Question

The following link explains it.
The implementation is said to work by storing the XOR of the previous and next address(say nxp), instead of storing both(previous and

Answer 1

XOR has a very special property about it, namely, given a XOR b = c, only two (any two) of the variable are required to compute the the third, with some restrictions. See the XOR swap algorithm for why this works.

In this case the previous (or next) pointer must still be carried, but only through traversal calculations and not as a seperate member.