Describe a method for finding the middle node of a do
Java
Please help me with this. Thanks in advance.
//Java Program to finding the middle element in doubly linked list
class Node
{
int num;
Node next;
// constructor of the class Node
Node(int n)
{
this.num = n;
this.next = null;
}
}
class T
{
public void findNode(Node n)
{
if(n == null)
{
return;
}
Node slow = n;
Node fast = n;
while(fast != null && fast.next != null)
{
// fast pointer is taking two steps at a time
fast = fast.next.next;
// slow pointer is taking one step at a time
slow = slow.next;
}
System.out.println("The middle node of the linked list is: " + slow.num);
}
}
public class n
{
// main method
public static void main(String args[])
{
// head node of the linked list
Node h = new Node(13);
// remaining node of the linked list
h.next = new Node(17);
h.next.next = new Node(90);
h.next.next.next = new Node(76);
h.next.next.next.next = new Node(45);
h.next.next.next.next.next = new Node(32);
h.next.next.next.next.next.next = new Node(10);
// creating an object of the class TwoPointerExample1
TwoPointerExample1 obj = new TwoPointerExample1();
// invoking the method findNode()
obj.findNode(h);
}
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
