Geeksforgeeks · Technology

Split a Circular Linked List into two halves

Given a Circular linked list. The task is split into two Circular Linked lists. If there are an odd number of nodes in the given circular linked list then out of the resulting two halved lists, the first list should have one node more than the second list.Examples:Input: 10->4->9Output: 10->4

Read original Open in app

Licensed summary · LicensedSummary