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

find merge point of two linked list in java

Add Answer

Anjali Sharma answered on January 5, 2023 Popularity 2/10 Helpfulness 1/10

answer find merge point of two linked list in java

find merge point of two linked list in java

Comment

Time Complexity: O(M + N), where N and M are the length of the two lists.

Auxiliary Space: O(M + N)

// 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 headA, Node headB)
    {
        Stack<Node> stackA = new Stack<Node>();
        Stack<Node> stackB = new Stack<Node>();
        Node intersectNode = null;
 
        while (headB != null) {
            stackB.push(headB);
            headB = headB.next;
        }
 
        while (headA != null) {
            stackA.push(headA);
            headA = headA.next;
        }
 
        if (!stackA.peek().equals(stackB.peek())) {
            return null;
        }
 
        while (!stackA.empty() && !stackB.empty()
               && stackA.peek().equals(stackB.peek())) {
            intersectNode = stackA.pop();
            stackB.pop();
        }
 
        return intersectNode;
    }
 
    // 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("INTERSECTION POINT: "
                         + intersect_node.data);
    }
}

https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/

Popularity 2/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: find java javascript linked-list merge point

Link to this answer
Share Copy Link

Contributed on Jan 05 2023

Anjali Sharma

0 Answers Avg Quality 2/10

find merge point of two linked list in java

Contents

More Related Answers

find merge point of two linked list in java

Grepper

Documentation

Social

Legal

Contact

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