What is a memory efficient double linked list?
1
The list has breakpoints for faster traversal
2
Each node has only one pointer to traverse the list back and forth
3
A doubly linked list that uses bitwise AND operator for storing addresses
4
An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list