Breaking News: Grepper is joining You.com. Read the official announcement!

merge point of two linked list

Java Geek answered on September 23, 2022 Popularity 6/10 Helpfulness 1/10

answer merge point of two linked list

merge point of two linked list

Comment

// JAVA program to print intersection of lists
 
import java.util.*;
 
class GFG{
 
/* Link list node */
static class Node {
    int data;
    Node next;
};
 
// A utility function to return  intersection node
static Node intersectPoint(Node head1, Node head2)
{
    // Maintaining two pointers ptr1 and ptr2
    // at the head of A and B,
    Node ptr1 = head1;
    Node ptr2 = head2;
 
    // If any one of head is null i.e
    // no Intersection Point
    if (ptr1 == null || ptr2 == null) {
 
        return null;
    }
 
    // Traverse through the lists until they
    // reach Intersection node
    while (ptr1 != ptr2) {
 
        ptr1 = ptr1.next;
        ptr2 = ptr2.next;
 
        // If at any node ptr1 meets ptr2, then it is
        // intersection node.Return intersection node.
 
        if (ptr1 == ptr2) {
 
            return ptr1;
        }
        /* Once both of them go through reassigning,
        they will be equidistant from the collision point.*/
 
        // When ptr1 reaches the end of a list, then
        // reassign it to the head2.
        if (ptr1 == null) {
 
            ptr1 = head2;
        }
        // When ptr2 reaches the end of a list, then
        // redirect it to the head1.
        if (ptr2 == null) {
 
            ptr2 = head1;
        }
    }
 
    return ptr1;
}
 
// Function to print intersection nodes
// in  a given linked list
static void print(Node node)
{
    if (node == null)
        System.out.print("null");
    while (node.next != null) {
        System.out.print(node.data+ ".");
        node = node.next;
    }
    System.out.print(node.data);
}
   
// Driver code
public static void main(String[] args)
{
    /*
    Create two linked lists
 
    1st Linked list is 3.6.9.15.30
    2nd Linked list is 10.15.30
 
    15 30 are elements in the intersection list
    */
 
    Node newNode;
    Node head1 = new Node();
    head1.data = 10;
    Node head2 = new Node();
    head2.data = 3;
    newNode = new Node();
    newNode.data = 6;
    head2.next = newNode;
    newNode = new Node();
    newNode.data = 9;
    head2.next.next = newNode;
    newNode = new Node();
    newNode.data = 15;
    head1.next = newNode;
    head2.next.next.next = newNode;
    newNode = new Node();
    newNode.data = 30;
    head1.next.next = newNode;
    head1.next.next.next = null;
    Node intersect_node = null;
 
    // Find the intersection node of two linked lists
    intersect_node = intersectPoint(head1, head2);
 
    System.out.print("INTERSEPOINT LIST :");
 
    print(intersect_node);
}
}
 
// This code is contributed by umadevi9616.

Popularity 6/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: linked-list merge point whatever

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Java Geek

0 Answers Avg Quality 2/10

merge point of two linked list

Contents

More Related Answers

merge point of two linked list

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.