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 of the mentioned