technojam/Ultimate_Algorithms_Repository

XOR Linked List; traversal

Aperta

#314 aperta il 16 ott 2020

 (1 commento) (0 reazioni) (0 assegnatari)C++ (165 fork)auto 404
hacktoberfest

Metriche repository

Star
 (87 stelle)
Metriche merge PR
 (Metriche PR in attesa)

Descrizione

XOR Linked List

  • In a doubly linked list, you store two pointers per node: prev and next. In an XOR linked list, you store one pointer per node, which is the XOR of prev and next, or if one of them is absent, just the other, which is the same as XORing with 0.
  • The reason why you can still traverse an XOR linked list in both directions relies on the properties of XOR and the redundancy of information inherent in a double linked list.

Guida contributor