title: How do I merge linked list alternately without using nodes? and by using recursion?
body: <p>There are no errors but it still won't work. I can't figure out what's wrong. We still haven't discussed the concept of nodes in class so I have trouble understanding it.</p>
  <p>It's output should be:</p>
  <p>Skinny Love- Birdy</p>
  <p>Happier- Ed Sheeran</p>
  <p>Someday- Chelsea Cutler</p>
  <pre><code>public class HandsOnAct1 {
  
    static LinkedList songs = new LinkedList();
    static LinkedList artists = new LinkedList();
    static LinkedList playlist = new LinkedList();
    
    public static void Merge(){
        int element= songs.size();
        int number=0;
        
        System.out.println(element);
        
    if (number !=element){
    playlist.add(number, songs);
    playlist.add(number,artists);
    number++;
    
    }
        System.out.println(playlist);
    }
    
  
      public static void main(String[] args) {
   
          songs.add(&quot;Skinny Love&quot;);
          songs.add(&quot;Happier&quot;);
          songs.add(&quot;Sometimes&quot;);
          
          artists.add(&quot;Birdy&quot;);
          artists.add(&quot;Ed Sheeran&quot;);
          artists.add(&quot;Chelsea Cutler&quot;);
          
          Merge();    
      }
      
  }
  
  </code></pre>