All activity
Today we will be discussing the algorithm to Exchange First and Last nodes in Circular Linked List . Suppose we have circular linked list 1->2->3->4 and 4 points to 1. Then after swapping the first and last node the circular linked list will look like 4->2->3->1 and 1 points to 4.
Exchange nodes in a Circular Linked ListToday we will be discussing the algorithm to Exchange First