Exercise $2$

If your first name starts with a letter from A$-$J inclusively:

Use the SinglyLinkedList implementation of the textbook $($week $2$ lecture examples. Write a method for concatenating two singly linked lists L$1$ and L$2,$ into a single list L that contains all the nodes of L$1$ followed by all the nodes of L$2.$ Write a main method to test the new method. Hint: Connect the end of L$1$ into the beginning of L$2.$

If your first name starts with a letter from K$-$Z inclusively:

Use the DoublyLinkedList implementation of the textbook $($week $2$ lecture examples. Write a method for concatenating two doubly linked lists L$1$ and L$2,$ into a single list L that contains all the nodes of L$1$ followed by all the nodes of L$2.$ Write a main method to test the new method. Hint: Connect the end of L$1$ into the beginning of L$2.$