In this tutorial, Let’s discuss how to find middle element of a linked list in a single traversal.
Given a singly linked list, write a code to find middle element in a linked list.
For example: Given a linked list, the middle element in this linked list is 8.
15 -> 9 -> 8 -> 5 -> 6 -> NULL
This type of questions are generally asked in an interviews.
There are multiple approaches to solve this problem. In this tutorial, I am going to discuss two approaches through which we can find the middle element of a singly linked list in one pass.
I have also added video tutorial at the end of this post.