• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Memory Efficient LinkedList

August 24, 2014 by Dhaval Dave

Memory efficient linked list is also called XOR Linked List.
To use lesser memory in doubly link list, such data structure is used.

An ordinary doubly linked list stores addresses of the previous and next list items in each list node, requiring two address fields:

...  A       B         C         D         E  ...
–> next –> next –> next –>
<– prev <– prev <– prev <–

An XOR linked list compresses the same information into one address field by storing the bitwise XOR (here denoted by ⊕) of the address for previous and the address for next in one field:

...  A        B         C         D         E  ...
<–> A⊕C <-> B⊕D <-> C⊕E <->


We can traverse the XOR list in both forward and reverse direction. While traversing the list we need to remember the address of the previously accessed node in order to calculate the next node’s address

For example:
When we are at node C, we must have address of B stored in some extra variable.
XOR of ADD(B) and XAdd of C gives us the ADD(D).

Reason is simple: XAdd(C) is : “ADD(B) XOR ADD(D)”.
If we do xor of XAdd(C) with ADD(B), we get the result as
“ADD(B) XOR ADD(D) XOR ADD(B)” = “ADD(D) XOR 0″ = “ADD(D)”.
So we have the address of next node.
Similarly we can traverse the list in backward direction.

#include <stdio.h>
#include <stdlib.h>
#define gc getchar_unlocked
inline int scan(){register int n=0,c=gc();while(c<‘0’||c>’9’)c=gc();while(c<=’9’&&c>=’0′)n=(n<<1)+(n<<3)+c-‘0’,c=gc();return n;} 

typedef struct node
{
    int data;
    struct node* np;  /* XOR of next and previous node */
}node;
node *head, *tail;

struct node* XOR (struct node *a, struct node *b){
    return (struct node*) ((unsigned int) (a) ^ (unsigned int) (b));
}
void insert(int data)
{
    node *new_node = (node*) malloc(sizeof(node));
    new_node->data = data;

    if (NULL == head) {
        new_node->np = NULL;
        head = tail = new_node;
    } 
    //else if (at_tail) {
    else{
        new_node->np = XOR(tail, NULL);
        tail->np = XOR(new_node, XOR(tail->np, NULL));
        tail = new_node;
    } 
    /*else {  //code to enter new node at head 
        new_node->np = XOR(NULL, head);
        head->np = XOR(new_node, XOR(NULL, head->np));
        head = new_node;
    }*/
}


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){
        printf (“%d “, curr->data);        
        next = XOR (prev, curr->np);
        prev = curr;
        curr = next;    
    }    
}

// Driver program to test above functions
int main ()
{
    //struct node *head = (struct node *) malloc (sizeof (struct node) );
    head = NULL;

    
    int t,n;
    t=scan();
    printf(“%dn”,t);
    
    while(t–){
        n=scan();
        insert(n);
    }
    printList (head);

    return (0);
}

See working code at http://ideone.com/YdZmJk
Reference :  http://www.linuxjournal.com/

Similar Articles

Filed Under: problem Tagged With: Linked List

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Printing intermediate Integers between one element & next element of array

VMWare SDEII Interview

C Program for TAIL command of UNIX

Find if two rectangles overlap

SAP Off Campus Hiring_ March 2015 Verbal Skills

Max Sum in circularly situated Values

Urban Ladder Written Test.

Facebook Interview Question : Interleave List

Length of the longest substring without repeating characters

C++ OOPs Part2

Maximum occurred Smallest integer in n ranges

Given a string, find the first character which is non-repetitive

Reversal of LinkedList

Given Set of words or A String find whether chain is possible from these words or not

How Radix sort works

ADOBE Aptitude C Language Test

Trie Dictionary

Find the number ABCD such that when multipled by 4 gives DCBA.

Maximum of all subarrays of size k

The Magic HackerEarth Nirvana solutions Hiring Challenge

Subset Sum Problem Dynamic programming

Trapping Rain Water

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

TicTacToe Game As Asked in Flipkart

Right view of Binary tree

1014 Practice Question of New GRE – Princeton

Stock Buy Sell to Maximize Profit

Advanced SQL Injection

Find min element in Sorted Rotated Array (Without Duplicates)

Python String and numbers

Copyright © 2025 · Genesis Framework · WordPress · Log in