Find middle element of a linked list in java

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

This is one of the popular interview question.
In this post, we will discuss how to find middle element in linkedlist in most efficient way.

Java Linked List Interview Programs:


I am not using java LinkedList API here. If you use that API, you can directly find size of linkedlist using size() function and then locate length/2.

One of the algo for this would be:

  • Traverse the list and find the length of list
  • After finding length, again traverse the list and locate n/2 element from head of linkedlist.

Time complexity=time for finding length of list + time for locating middle element=o(n)+o(n) =o(n)
Space complexity= o(1).

Efficient approach:

Above approach will take two traversal but we can find middle element in one traversal also using following algo:

  1. Use two pointer fastptr and slowptr and initialize both to head of linkedlist
  2. Move fastptr by two nodes and slowptr by one node in each iteration.
  3. When fastptr reaches end of nodes, the slowptr pointer will be  pointing to middle element.

Lets create java program for it:

Logically linked list can be represented as:

Middle element is represented in red color.
Run above program, you will get following output:

Please go through java interview programs for more such programs.


You may also like:

Related Posts

Leave a Reply

Your email address will not be published. Required fields are marked *

Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.