Q40
In a circular doubly linked list, how is the last node connected to the first node?
A.
Through a null pointer
B.
Through the head pointer
C.
Through the next pointer of the first node
AnswerD.
Through the previous pointer of the first node
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board