Q120
What is a memory efficient double linked list?
A.
Each node has only one pointer to traverse the list back and forth
AnswerB.
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: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board