Home › MCQs › CSS Computer Science › Question #1128
Back to Questions
CSS Computer Science QUESTION #1128
Question 1
How is the head node deleted in a doubly circular linked list?
  • By adjusting the prev pointer of the new head node to null.
  • By setting the next pointer of prev node to point to new head.✔️
  • By pointing the next pointer of last node to null.
  • None of these
Correct Answer Explanation
To delete the head in a circular list, the last node's next pointer and the second node's prev pointer must be updated to maintain the circular link.