This topic isn’t there in the lecture videos.
Q8. Memory Efficient List
What is a memory efficient double linked list?
a. Each node has only one pointer to traverse the list back and forth
b. The list has breakpoints for faster traversal
c. An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
d. None
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.
how does it work with the bitwise XOR operator?
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.