Skip to content
Related Articles

Related Articles

Find the middle of a given linked list
  • Difficulty Level : Easy
  • Last Updated : 11 May, 2021

Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. 
If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then output should be 4. 

Method 1: 
Traverse the whole linked list and count the no. of nodes. Now traverse the list again till count/2 and return the node at count/2. 

Method 2: 
Traverse linked list using two pointers. Move one pointer by one and the other pointers by two. When the fast pointer reaches the end slow pointer will reach the middle of the linked list.

Below image shows how printMiddle function works in the code :

middle-of-a-given-linked-list-in-C-and-Java1



 

C++




// C++ program to find middle of linked list
#include<bits/stdc++.h>
using namespace std;
 
// Struct
struct Node
{
    int data;
    struct Node* next;
};
 
/* Function to get the middle of the linked list*/
void printMiddle(struct Node *head)
{
    struct Node *slow_ptr = head;
    struct Node *fast_ptr = head;
 
    if (head!=NULL)
    {
        while (fast_ptr != NULL && fast_ptr->next != NULL)
        {
            fast_ptr = fast_ptr->next->next;
            slow_ptr = slow_ptr->next;
        }
        printf("The middle element is [%d]\n\n", slow_ptr->data);
    }
}
 
// Function to add a new node
void push(struct Node** head_ref, int new_data)
{
    /* allocate node */
    struct 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;
}
 
// A utility function to print a given linked list
void printList(struct Node *ptr)
{
    while (ptr != NULL)
    {
        printf("%d->", ptr->data);
        ptr = ptr->next;
    }
    printf("NULL\n");
}
 
// Driver Code
int main()
{
    // Start with the empty list
    struct Node* head = NULL;
     
    // Iterate and add element
    for (int i=5; i>0; i--)
    {
        push(&head, i);
        printList(head);
        printMiddle(head);
    }
 
    return 0;
}
C



// C program to find middle of linked list
#include<stdio.h>
#include<stdlib.h>
 
/* Link list node */
struct Node
{
    int data;
    struct Node* next;
};
 
/* Function to get the middle of the linked list*/
void printMiddle(struct Node *head)
{
    struct Node *slow_ptr = head;
    struct Node *fast_ptr = head;
 
    if (head!=NULL)
    {
        while (fast_ptr != NULL && fast_ptr->next != NULL)
        {
            fast_ptr = fast_ptr->next->next;
            slow_ptr = slow_ptr->next;
        }
        printf("The middle element is [%d]\n\n", slow_ptr->data);
    }
}
 
void push(struct Node** head_ref, int new_data)
{
    /* allocate node */
    struct Node* new_node =
        (struct Node*) malloc(sizeof(struct 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;
}
 
// A utility function to print a given linked list
void printList(struct Node *ptr)
{
    while (ptr != NULL)
    {
        printf("%d->", ptr->data);
        ptr = ptr->next;
    }
    printf("NULL\n");
}
 
/* Driver program to test above function*/
int main()
{
    /* Start with the empty list */
    struct Node* head = NULL;
    int i;
 
    for (i=5; i>0; i--)
    {
        push(&head, i);
        printList(head);
        printMiddle(head);
    }
 
    return 0;
}
Java



// Java program to find middle of linked list
class LinkedList
{
    Node head; // head of linked list
 
    /* Linked list node */
    class Node
    {
        int data;
        Node next;
        Node(int d)
        {
            data = d;
            next = null;
        }
    }
 
    /* Function to print middle of linked list */
    void printMiddle()
    {
        Node slow_ptr = head;
        Node fast_ptr = head;
        if (head != null)
        {
            while (fast_ptr != null && fast_ptr.next != null)
            {
                fast_ptr = fast_ptr.next.next;
                slow_ptr = slow_ptr.next;
            }
            System.out.println("The middle element is [" +
                                slow_ptr.data + "] \n");
        }
    }
 
    /* Inserts a new Node at front of the list. */
    public void push(int new_data)
    {
        /* 1 & 2: Allocate the Node &
                  Put in the data*/
        Node new_node = new Node(new_data);
 
        /* 3. Make next of new Node as head */
        new_node.next = head;
 
        /* 4. Move the head to point to new Node */
        head = new_node;
    }
 
    /* This function prints contents of linked list
       starting from  the given node */
    public void printList()
    {
        Node tnode = head;
        while (tnode != null)
        {
            System.out.print(tnode.data+"->");
            tnode = tnode.next;
        }
        System.out.println("NULL");
    }
 
    public static void main(String [] args)
    {
        LinkedList llist = new LinkedList();
        for (int i=5; i>0; --i)
        {
            llist.push(i);
            llist.printList();
            llist.printMiddle();
        }
    }
}
// This code is contributed by Rajat Mishra
C#



// C# program to find middle of linked list
using System;
 
class LinkedList{
     
// Head of linked list 
Node head;
 
// Linked list node
class Node
{
    public int data;
    public Node next;
     
    public Node(int d)
    {
        data = d;
        next = null;
    }
}
 
// Function to print middle of linked list
void printMiddle()
{
    Node slow_ptr = head;
    Node fast_ptr = head;
     
    if (head != null)
    {
        while (fast_ptr != null &&
               fast_ptr.next != null)
        {
            fast_ptr = fast_ptr.next.next;
            slow_ptr = slow_ptr.next;
        }
        Console.WriteLine("The middle element is [" +
                          slow_ptr.data + "] \n");
    }
}
 
// Inserts a new Node at front of the list.
public void push(int new_data)
{
     
    /* 1 & 2: Allocate the Node &
              Put in the data*/
    Node new_node = new Node(new_data);
 
    /* 3. Make next of new Node as head */
    new_node.next = head;
 
    /* 4. Move the head to point to new Node */
    head = new_node;
}
 
// This function prints contents of linked
// list starting from  the given node
public void printList()
{
    Node tnode = head;
    while (tnode != null)
    {
        Console.Write(tnode.data + "->");
        tnode = tnode.next;
    }
    Console.WriteLine("NULL");
}
 
// Driver code
static public void Main()
{
    LinkedList llist = new LinkedList();
    for(int i = 5; i > 0; --i)
    {
        llist.push(i);
        llist.printList();
        llist.printMiddle();
    }
}
}
 
// This code is contributed by Dharanendra L V.
Python3



# Python3 program to find middle of linked list
# Node class
class Node:
   
    # Function to initialise the node object
    def __init__(self, data):
        self.data = data  # Assign data
        self.next = None  # Initialize next as null
   
   
# Linked List class contains a Node object
class LinkedList:
   
    # Function to initialize head
    def __init__(self):
        self.head = None
 
    # Function to insert a new node at the beginning 
    def push(self, new_data): 
        new_node = Node(new_data) 
        new_node.next = self.head 
        self.head = new_node
 
    # Print the linked list
    def printList(self):
        node = self.head
        while node:
            print(str(node.data) + "->", end="")
            node = node.next
        print("NULL")
 
    # Function that returns middle.
    def printMiddle(self):
        # Initialize two pointers, one will go one step a time (slow), another two at a time (fast)
        slow = self.head
        fast = self.head
 
        # Iterate till fast's next is null (fast reaches end)
        while fast and fast.next:
            slow = slow.next
            fast = fast.next.next
         
        # return the slow's data, which would be the middle element.
        print("The middle element is ", slow.data)
 
# Code execution starts here
if __name__=='__main__':
   
    # Start with the empty list
    llist = LinkedList()
   
    for i in range(5, 0, -1):
        llist.push(i)
        llist.printList()
        llist.printMiddle()
 
 # Code is contributed by Kumar Shivam (kshivi99)
 
 
Output
5->NULL
The middle element is [5]

4->5->NULL
The middle element is [5]

3->4->5->NULL
The middle element is [4]

2->3->4->5->NULL
The middle element is [4]

1->2->3->4->5->NULL
The middle element is [3]
 
Method 3: 
Initialize mid element as head and initialize a counter as 0. Traverse the list from head, while traversing increment the counter and change mid to mid->next whenever the counter is odd. So the mid will move only half of the total length of the list. 
Thanks to Narendra Kangralkar for suggesting this method.  
 
C++



#include <bits/stdc++.h>
using namespace std;
 
// Link list node
struct node
{
    int data;
    struct node* next;
};
 
// Function to get the middle of
// the linked list
void printMiddle(struct node* head)
{
    int count = 0;
    struct node* mid = head;
 
    while (head != NULL)
    {
         
        // Update mid, when 'count'
        // is odd number
        if (count & 1)
            mid = mid->next;
 
        ++count;
        head = head->next;
    }
 
    // If empty list is provided
    if (mid != NULL)
        printf("The middle element is [%d]\n\n",
                mid->data);
}
 
void push(struct node** head_ref, int new_data)
{
     
    // Allocate node
    struct node* new_node = (struct node*)malloc(
        sizeof(struct 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;
}
 
// A utility function to print
// a given linked list
void printList(struct node* ptr)
{
    while (ptr != NULL)
    {
        printf("%d->", ptr->data);
        ptr = ptr->next;
    }
    printf("NULL\n");
}
 
// Driver code
int main()
{
     
    // Start with the empty list
    struct node* head = NULL;
    int i;
 
    for(i = 5; i > 0; i--)
    {
        push(&head, i);
        printList(head);
        printMiddle(head);
    }
    return 0;
}
 
// This code is contributed by ac121102
C



#include <stdio.h>
#include <stdlib.h>
 
/* Link list node */
struct node {
    int data;
    struct node* next;
};
 
/* Function to get the middle of the linked list*/
void printMiddle(struct node* head)
{
    int count = 0;
    struct node* mid = head;
 
    while (head != NULL) {
        /* update mid, when 'count' is odd number */
        if (count & 1)
            mid = mid->next;
 
        ++count;
        head = head->next;
    }
 
    /* if empty list is provided */
    if (mid != NULL)
        printf("The middle element is [%d]\n\n", mid->data);
}
 
void push(struct node** head_ref, int new_data)
{
    /* allocate node */
    struct node* new_node
        = (struct node*)malloc(sizeof(struct 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;
}
 
// A utility function to print a given linked list
void printList(struct node* ptr)
{
    while (ptr != NULL) {
        printf("%d->", ptr->data);
        ptr = ptr->next;
    }
    printf("NULL\n");
}
 
/* Driver program to test above function*/
int main()
{
    /* Start with the empty list */
    struct node* head = NULL;
    int i;
 
    for (i = 5; i > 0; i--) {
        push(&head, i);
        printList(head);
        printMiddle(head);
    }
 
    return 0;
}
Java



class GFG{
 
static Node head;
 
// Link list node
class Node
{
    int data;
    Node next;
 
    // Constructor
    public Node(Node next, int data)
    {
        this.data = data;
        this.next = next;
    }
}
 
// Function to get the middle of
// the linked list
void printMiddle(Node head)
{
    int count = 0;
    Node mid = head;
 
    while (head != null)
    {
 
        // Update mid, when 'count'
        // is odd number
        if ((count % 2) == 1)
            mid = mid.next;
 
        ++count;
        head = head.next;
    }
 
    // If empty list is provided
    if (mid != null)
        System.out.println("The middle element is [" +
                            mid.data + "]\n");
}
 
void push(Node head_ref, int new_data)
{
     
    // Allocate node
    Node new_node = new Node(head_ref, new_data);
 
    // Move the head to point to the new node
    head = new_node;
}
 
// A utility function to print a
// given linked list
void printList(Node head)
{
    while (head != null)
    {
        System.out.print(head.data + "-> ");
        head = head.next;
    }
    System.out.println("null");
}
 
// Driver code
public static void main(String[] args)
{
    GFG ll = new GFG();
 
    for(int i = 5; i > 0; i--)
    {
        ll.push(head, i);
        ll.printList(head);
        ll.printMiddle(head);
    }
}
}
 
// This code is contributed by mark_3
Python3



# Node class
class Node:
    
    # Function to initialise the node object
    def __init__(self, data):
        self.data = data  # Assign data
        self.next = None  # Initialize next as null
    
# Linked List class contains a Node object
class LinkedList:
    
    # Function to initialize head
    def __init__(self):
        self.head = None
  
    # Function to insert a new node at the beginning 
    def push(self, new_data): 
        new_node = Node(new_data) 
        new_node.next = self.head 
        self.head = new_node
  
    # Print the linked list
    def printList(self):
        node = self.head
        while node:
            print(str(node.data) + "->", end = "")
            node = node.next
        print("NULL")
  
    # Function to get the middle of
    #  the linked list
    def printMiddle(self):
        count = 0
        mid = self.head
        heads = self.head
   
        while(heads != None):
       
        # Update mid, when 'count'
        # is odd number
            if count&1:
                mid = mid.next
            count += 1
            heads = heads.next
             
        # If empty list is provided
        if mid!=None:
            print("The middle element is ", mid.data)
  
# Code execution starts here
if __name__=='__main__':
    
    # Start with the empty list
    llist = LinkedList()
    
    for i in range(5, 0, -1):
        llist.push(i)
        llist.printList()
        llist.printMiddle()
  
 # This Code is contributed by Manisha_Ediga
C#



using System;
 
public class GFG
{
 
    static Node head;
 
    // Link list node
    public
 
 class Node {
        public
 
 int data;
        public
 
 Node next;
 
        // Constructor
        public Node(Node next, int data) {
            this.data = data;
            this.next = next;
        }
    }
 
    // Function to get the middle of
    // the linked list
    void printMiddle(Node head) {
        int count = 0;
        Node mid = head;
 
        while (head != null) {
 
            // Update mid, when 'count'
            // is odd number
            if ((count % 2) == 1)
                mid = mid.next;
 
            ++count;
            head = head.next;
        }
 
        // If empty list is provided
        if (mid != null)
            Console.WriteLine("The middle element is [" + mid.data + "]\n");
    }
 
    public void Push(Node head_ref, int new_data) {
 
        // Allocate node
        Node new_node = new Node(head_ref, new_data);
 
        // Move the head to point to the new node
        head = new_node;
    }
 
    // A utility function to print a
    // given linked list
    void printList(Node head) {
        while (head != null) {
            Console.Write(head.data + "-> ");
            head = head.next;
        }
        Console.WriteLine("null");
    }
 
    // Driver code
    public static void Main(String[] args) {
        GFG ll = new GFG();
 
        for (int i = 5; i > 0; i--) {
            ll.Push(head, i);
            ll.printList(head);
            ll.printMiddle(head);
        }
    }
}
 
 
// This code is contributed by Rajput-Ji
Output
5->NULL
The middle element is [5]

4->5->NULL
The middle element is [5]

3->4->5->NULL
The middle element is [4]

2->3->4->5->NULL
The middle element is [4]

1->2->3->4->5->NULL
The middle element is [3]
 
 Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 
 
My Personal Notes
arrow_drop_up
Previous
Program for n'th node from the end of a Linked List
Next

Write a function that counts the number of times a given int occurs in a Linked List
Recommended Articles
Page :
Find middle of singly linked list Recursively
06, Mar 18
Python program to find middle of a linked list using one traversal
28, Dec 18
XOR Linked List - Find the middle node
17, Dec 20
Find kth node from Middle towards Head of a Linked List
20, Sep 18
Given a linked list of line segments, remove middle points
08, Dec 14
Iterative approach for removing middle points in a linked list of line segements
11, Feb 18
Insert N elements in a Linked List one after other at middle position
04, Apr 19
Traverse Linked List from middle to left-right order using recursion
08, Aug 19
Java Program to Insert a New Node at the Middle of the Circular Linked List
17, Jan 21
Make middle node head in a linked list
29, Sep 17
Delete middle of linked list
08, Jun 16
Insert node into the middle of the linked list
29, Aug 17
Generate Linked List consisting of maximum difference of squares of pairs of nodes from given Linked List
29, Oct 20
XOR Linked List - Reverse a Linked List in groups of given size
17, Jan 21
XOR Linked List - Pairwise swap elements of a given linked list
18, Jan 21
Create new linked list from two given linked list with greater element at each node
22, May 19
XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
23, May 11
Merge a linked list into another linked list at alternate positions
20, Aug 13
Difference between Singly linked list and Doubly linked list
07, Jan 19
XOR linked list- Remove first node of the linked list
18, Jan 21
XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
14, Jun 12
XOR Linked List: Remove last node of the Linked List
24, Feb 21
XOR linked list: Reverse last K nodes of a Linked List
05, Mar 21
Check if a linked list is Circular Linked List
10, Jun 16
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox