Question

Write an algorithm to copy a circular linked list.

Answer 1

Answer:

Allocate the new Node in the Heap using malloc() & set its data. Recursively set the next pointer of the new Node by recurring for the remaining nodes. Return the head pointer of the duplicate node. Finally, print both the original linked list and the duplicate linked list.

Answer 2

Allocate the new Node in the Heap using malloc() & set its data. Recursively set the next pointer of the new Node by recurring for the remaining nodes. Return the head pointer of the duplicate node. Finally, print both the original linked list and the duplicate linked list.

hope it helps uu