using System;

public class Node

{

    public int data;

    public Node next;

    public Node(int i)

    {

        data = i;

    }

    public void Print()

    {

        Console.Write(data + "->");

        if(next != null)

        {

            next.Print();

        }

        else

        {

            Console.Write("null");

        }

    }

    public void AddToEnd(int v)

    {

        if(next!=null)

        {

            next.AddToEnd(v);

        }

        else

        {

            next = new Node(v);

        }

    }

}

​

public class List

{

    public Node headNode;

    public List()

    {

        headNode = null;

    }

    public void Print()

    {

        headNode.Print();

    }

    public void AddToEnd(int v)

    {

        if(headNode == null)

        {

            headNode = new Node(v);

        }

        else

        {

            headNode.AddToEnd(v);

        }

    }

​

    public void FindMiddle(Node headNode)

    {

        Node curr = headNode;

        int n =0, m=0, middle=0;

        Node start = headNode;

        while(curr != null)

        {

            n = n+1;

            curr = curr.next;

        }

        middle = Convert.ToInt16(n/2) + 1; //taking the seocnd one in case of even no. list

        curr = headNode;

        while(curr!=null)

        {

            m = m+1;

            if(m == middle)

            {

                Console.WriteLine("Middle of linked list:" + curr.data);

            }

            curr = curr.next;

        }

    }

}

​

public class Program

{

    public static void Main()

    {

        List l = new List();

        l.AddToEnd(20);

        l.AddToEnd(30);

        l.AddToEnd(40);

        l.AddToEnd(50);

        l.AddToEnd(60);

        l.AddToEnd(70);

        l.Print();

        Console.WriteLine(" ");

        l.FindMiddle(l.headNode);

    }

}