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. A doubly linked list that uses bitwise AND operator for storing addresses
Answer:A
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. A doubly linked list that uses bitwise AND operator for storing addresses
Explanation: Memory efficient doubly linked list has only one pointer to traverse the list back and forth. The implementation is based on pointer difference. It uses a bitwise XOR operator to store the front and rear pointer addresses. Instead of storing the actual memory address, every node stores the XOR address of previous and next nodes.