XOR Linked List – A Memory Efficient Doubly Linked List | Set 1 An ordinary Doubly Linked List requires space for two address fields to store the addresses of previous and next nodes. A memory efficient version of Doubly Linked List can be created using only one space for address field with every node. This memory efficient Doubly Linked List is called XOR Linked List or Memory Efficient as the list uses bitwise XOR operation to save space for one address. In the XOR linked list, instead of storing actual memory addresses, every node stores the XOR of addresses of previous and next nodes.
Read full article from XOR Linked List - A Memory Efficient Doubly Linked List | Set 1 | GeeksforGeeks
No comments:
Post a Comment