What is a memory efficient double linked list?
Each node has only one pointer to traverse the list back and forth
The list has breakpoints for faster traversal
An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
None
hello @KetanPandey
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 bitwise XOR operator to store the front and rear pointer addresses. Instead of storing actual memory address, every node store the XOR address of previous and next nodes.