![]() Consider the following doubly linked list: head-1-2-3-4-5-tail. ![]() How do you calculate the pointer difference in a memory efficient double linked list?ī) pointer to previous node xor pointer to next nodeĬ) pointer to previous node – pointer to next nodeĭ) pointer to next node – pointer to previous nodeĪnswer: pointer to previous node xor pointer to next node 5. What is a memory efficient double linked list?Īnswer: Each node has only one pointer to traverse the list back and forth 4. ![]() 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ĭ) A doubly linked list that uses bitwise AND operator for storing addressesĪnswer: Each node has only one pointer to traverse the list back and forth 3. Answer: implementing a doubly linked list is easier than singly linked list 2.
0 Comments
Leave a Reply. |