In the previous post, we discussed how a Doubly Linked can be created using only one space for address field with every node. In this post, we will discuss implementation of memory efficient doubly linked list. We will mainly discuss following two simple functions.

1) A function to insert a new node at the beginning.

2) A function to traverse the list in forward direction.

In the following code, *insert()* function inserts a new node at the beginning. We need to change the head pointer of Linked List, that is why a double pointer is used (See this). Let use first discuss few things again that have been discussed in the previous post. We store XOR of next and previous nodes with every node and we call it npx, which is the only address member we have with every node. When we insert a new node at the beginning, npx of new node will always be XOR of NULL and current head. And npx of current head must be changed to XOR of new node and node next to current head.

*printList()* traverses the list in forward direction. It prints data values from every node. To traverse the list, we need to get pointer to the next node at every point. We can get the address of next node by keeping track of current node and previous node. If we do XOR of curr->npx and prev, we get the address of next node.

`/* C/C++ Implementation of Memory ` ` ` `efficient Doubly Linked List */` `#include <stdio.h> ` `#include <stdlib.h> ` `#include <inttypes.h> ` ` ` `// Node structure of a memory ` `// efficient doubly linked list ` `struct` `Node ` `{ ` ` ` `int` `data; ` ` ` `struct` `Node* npx; ` `/* XOR of next and previous node */` `}; ` ` ` `/* returns XORed value of the node addresses */` `struct` `Node* XOR (` `struct` `Node *a, ` `struct` `Node *b) ` `{ ` ` ` `return` `(` `struct` `Node*) ((` `uintptr_t` `) (a) ^ (` `uintptr_t` `) (b)); ` `} ` ` ` `/* Insert a node at the begining of the ` ` ` `XORed linked list and makes the newly ` ` ` `inserted node as head */` `void` `insert(` `struct` `Node **head_ref, ` `int` `data) ` `{ ` ` ` `// Allocate memory for new node ` ` ` `struct` `Node *new_node = (` `struct` `Node *) ` `malloc` `(` `sizeof` `(` `struct` `Node) ); ` ` ` `new_node->data = data; ` ` ` ` ` `/* Since new node is being inserted at the ` ` ` `begining, npx of new node will always be ` ` ` `XOR of current head and NULL */` ` ` `new_node->npx = XOR(*head_ref, NULL); ` ` ` ` ` `/* If linked list is not empty, then npx of ` ` ` `current head node will be XOR of new node ` ` ` `and node next to current head */` ` ` `if` `(*head_ref != NULL) ` ` ` `{ ` ` ` `// *(head_ref)->npx is XOR of NULL and next. ` ` ` `// So if we do XOR of it with NULL, we get next ` ` ` `struct` `Node* next = XOR((*head_ref)->npx, NULL); ` ` ` `(*head_ref)->npx = XOR(new_node, next); ` ` ` `} ` ` ` ` ` `// Change head ` ` ` `*head_ref = new_node; ` `} ` ` ` `// prints contents of doubly linked ` `// list in forward direction ` `void` `printList (` `struct` `Node *head) ` `{ ` ` ` `struct` `Node *curr = head; ` ` ` `struct` `Node *prev = NULL; ` ` ` `struct` `Node *next; ` ` ` ` ` `printf` `(` `"Following are the nodes of Linked List: \n"` `); ` ` ` ` ` `while` `(curr != NULL) ` ` ` `{ ` ` ` `// print current node ` ` ` `printf` `(` `"%d "` `, curr->data); ` ` ` ` ` `// get address of next node: curr->npx is ` ` ` `// next^prev, so curr->npx^prev will be ` ` ` `// next^prev^prev which is next ` ` ` `next = XOR (prev, curr->npx); ` ` ` ` ` `// update prev and curr for next iteration ` ` ` `prev = curr; ` ` ` `curr = next; ` ` ` `} ` `} ` ` ` `// Driver program to test above functions ` `int` `main () ` `{ ` ` ` `/* Create following Doubly Linked List ` ` ` `head-->40<-->30<-->20<-->10 */` ` ` `struct` `Node *head = NULL; ` ` ` `insert(&head, 10); ` ` ` `insert(&head, 20); ` ` ` `insert(&head, 30); ` ` ` `insert(&head, 40); ` ` ` ` ` `// print the created list ` ` ` `printList (head); ` ` ` ` ` `return` `(0); ` `} ` |

*chevron_right*

*filter_none*

Output:

Following are the nodes of Linked List: 40 30 20 10

Note that XOR of pointers is not defined by C/C++ standard. So the above implementation may not work on all platforms.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

## Recommended Posts:

- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- Memory efficient doubly linked list
- Difference between Singly linked list and Doubly linked list
- Reverse a Doubly Linked List | Set-2
- Reverse a Doubly Linked List
- QuickSort on Doubly Linked List
- Implementation of Deque using doubly linked list
- Priority Queue using doubly linked list
- Delete a node in a Doubly Linked List
- Sort the biotonic doubly linked list | Set-2
- Merge Sort for Doubly Linked List
- Reverse a doubly circular linked list
- Find pairs with given sum in doubly linked list
- Rotate Doubly linked list by N nodes
- Delete all the even nodes from a Doubly Linked List