Read the wikipedia entry on XOR linked lists and liked it a lot! http://en.wikipedia.org/wiki/XOR_linked_list
Basic property they use is X#Y#X = X (# stands for XOR operation). So, if you store X#Y in the pointer field, then next node pointer is achievable by XORing this "pointer field" with previous field pointer. And prev node pointer is achievable by XORing this "pointer field" with next node pointer. Addition/Subtraction linked lists are also great! Read them on the link above. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
