Write the following methods for the Linked List class:
- Write a function called zip lists
- Arguments: 2 linked lists
- Return: New Linked List, zipped as noted below
- Zip the two linked lists together into one so that the nodes alternate between the two lists and return a reference to the the zipped list.
- Try and keep additional space down to O(1)
- Write out problem statement
- drew it out first because I didn't get it
- looked through linked list code from before
- loop list one then two, repeat in that order
- append into new list to create zipped
- The Big O Time: O(max(n, m)) because loop can continue based on length of a longer linked list. Space: O(n+m) because its linear with respect to the total number of nodes in both input lists.