University Project The task is based on implement a bidirectional list. A classic bidirectional list stores successor and predecessor addresses in nodes, in our task the list stores only xor of these addresses in nodes. This saves approximately 50% of memory used by the list structure.
NZ-code/XOR_list
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|