Finding Median in a Sorted Linked List

// C# program to find median
// of a linked list
using System;

class GFG 
{

    // Link list node
    class Node
    {

        public int data;
        public Node next;
    };

    /* Function to get the median 
    of the linked list */
    static void printMidean(Node head)
    {
        Node slow_ptr = head;
        Node fast_ptr = head;
        Node pre_of_slow = head;

        if (head != null) 
        {
            while (fast_ptr != null && 
                   fast_ptr.next != null) 
            {
                fast_ptr = fast_ptr.next.next;

                // previous of slow_ptr
                pre_of_slow = slow_ptr;
                slow_ptr = slow_ptr.next;
            }

            // if the below condition is true linked list
            // contain odd Node
            // simply return middle element
            if (fast_ptr != null)
            {
                Console.Write("Median is : " + 
                               slow_ptr.data);
            }
            
            // else linked list contain even element
            else
            {
                Console.Write("Median is : " + 
                       (float)(slow_ptr.data + 
                               pre_of_slow.data) / 2);
            }
        }
    }

    /* Given a reference (pointer to 
    pointer) to the head of a list 
    and an int, push a new node on 
    the front of the list. */
    static Node push(Node head_ref, int new_data)
    {
        // allocate node
        Node new_node = new Node();

        // put in the data
        new_node.data = new_data;

        // link the old list
        // off the new node
        new_node.next = head_ref;

        // move the head to point
        // to the new node
        head_ref = new_node;
        return head_ref;
    }

    // Driver Code
    public static void Main(String[] args) 
    {
        // Start with the
        // empty list
        Node head = null;

        // Use push() to construct
        // below list
        // 1->2->3->4->5->6
        head = push(head, 6);
        head = push(head, 5);
        head = push(head, 4);
        head = push(head, 3);
        head = push(head, 2);
        head = push(head, 1);

        // Check the count
        // function
        printMidean(head);
    }
} 

// This code is contributed by Rajput-Ji

using System;
public class ListNode
{
    public int val;
    public ListNode next;

    public ListNode(int x)
    {
        val = x;
        next = null;
    }
}

public class Solution
{
    public double FindMedian(ListNode head)
    {
        int n = 0;
        ListNode p = head;

        // Count the number of elements in the linked list
        while (p != null)
        {
            n++;
            p = p.next;
        }

        // Call the helper function to find the median
        return (n % 2 == 1) ? FindKth(head, n / 2)
                            : (FindKth(head, n / 2)
                               + FindKth(head, n / 2 - 1))
                                  / 2.0;
    }

    private int FindKth(ListNode head, int k)
    {
        ListNode p = head;

        // Iterate through the linked list until the kth
        // element
        while (k > 0)
        {
            p = p.next;
            k--;
        }

        // Return the kth element
        return p.val;
    }
}

public class GFG
{
    public static void Main(string[] args)
    {
        ListNode head = new ListNode(1);
        head.next = new ListNode(2);
        head.next.next = new ListNode(3);
        head.next.next.next = new ListNode(4);
        head.next.next.next.next = new ListNode(5);

        Solution solution = new Solution();
        Console.WriteLine("The median is:-> "
                           + solution.FindMedian(head));
    }
}