COSC 311  Homework 3/2/2017    Recursive zip

Distributed: 3/2/2017
Due: 3/7/2017 

Write Java code to recursively zip two linked lists (using nodes and references)
into a single list.

If the input lists are different sizes, then stop zipping when the end of the
shorter list is reached.

Examples:

zip( [1, 2, 3] , [11, 21, 31] ) ==> [ 1, 11, 2, 21, 3, 31 ]

zip( [1] , [100, 200, 3000] ) ==> [1, 100]

zip ( [] , [ 1, 2, 3, 4] ) ==> []

zip ( [ 5, 4, 3], [2, 1, 0] ) ==> [5, 2, 4, 1, 3, 0]

The data must be passed and returned to and from the recursive function. 
Do not use globals to effect the zip.

Print each original list, then print the zipped list.

Note, the number of lines of code will affect the grade.

Turn in:
  Hardcopy of your code.
  Screenshot of output
  In your code, include a header:
    [your name]
    [your URL of code]
    COSC 311
    HW 03/02
    WINTER 2017