Split a Circular Linked List into two halves

Splitting of a circular linked list into two parts. When linked list contains Even numbers of nodes. Then resulted of this, there are divided into two equal parts. head1 is contain first half nodes. And head2 contains second half nodes.

When linked list contain Odd numbers of nodes. Then head1 are containing of the one extra nodes. For example lets linked list contain 7 nodes in this situation first list contain 4 starting nodes and second list contain 3 last nodes pair.

Suppose we are inserted the following (1,2,3,4,5,6,7,8) node in a sequence.

Here given code implementation process.

1) Split a circular linked list into two halves java 2) Split a circular linked list into two halves in c++ 3) Split a circular linked list into two halves in c 4) Split a circular linked list into two halves in golang 5) Split a circular linked list into two halves in c# 6) Split a circular linked list into two halves in vb.net 7) Split a circular linked list into two halves in php 8) Split a circular linked list into two halves in node js 9) Split a circular linked list into two halves in typescript 10) Split a circular linked list into two halves in python 11) Split a circular linked list into two halves in ruby 12) Split a circular linked list into two halves in scala 13) Split a circular linked list into two halves in swift 14) Split a circular linked list into two halves in kotlin