Join the social network of Tech Nerds, increase skill rank, get work, manage projects...
 

  • How to merge linked list in java

    @rohit.puri
    Recommendations Offline Message

    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 0
    • 415
    Comment on it

    If we have two sorted linked list and we want to merge both in a new list without creating new node space then we can use recursive approach for this . This approach takes O(max(m,n)) time complexity for merging.

    Like we have a linked list named : list 1 1 -> 2 -> 3 -> 4

    and another list named : list2 5 -> 6 -> 7

    then resulting linked list will be 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7

    here is an coding example for merge operation :

    1. public Node<T> mergeLinkedList(Node<T> list1, Node<T> list2)
    2. {
    3.    if(list1 == null){
    4.        return list2;
    5.     }
    6.  
    7.    if(list2 == null){
    8.        return list1;
    9.     }
    10.  
    11.    if(list1.getValue() < list2.getValue()){
    12.       list1.next = mergeLinkedList(list1.next , list2);
    13.       return list1;
    14.    }else{
    15.       list2.next = mergeLinkedList(list2.next , list1);
    16.       return list2;
    17.     }
    18. }
    Android linkedlist merge merge java
    Comment on it

 0 Comment(s)

Sign In
Forgot Password?
                           OR                           
Create an account !!
                           OR                           
Register

Sign up using

                           OR                           
Forgot Password
Reset Password
Fill out the form below and reset your password: