Doubt doubt doubt

#1

Bhaiya…i do not get the 4th question. Can you explain it?? here concatenation means merging ???

Also Q8th, if doubly linked list has only one pointer then how come it is a doubly linked list???

#2

concatenation means appending one after the other… and can u share snippet of q8 which u are referring to

#3

Q8. Memory Efficient List 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

#4

Q4. List concatenation The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used? Singly linked list Doubly linked list Circular doubly linked list Array implementation of list

#5

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.
I hope it clears ur doubts

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.