Use the SinglyLinkedList implementation of the textbook (week 2 lecture examples. Write a method for concatenating two singly linked lists L1 and L2, into a single list L that contains all the nodes of L1 followed by all the nodes of L2. Write a main method to test the new method. Hint: Connect the end of L1 into the beginning of L2. 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 L1 and L2, into a single list L that contains all the nodes of L1 followed by all the nodes of L2. Write a main method to test the new method. Hint: Connect the end of L1 into the beginning of L2.
Using Fundamental Data Structures
Purpose: The purpose of this:
- Design and develop Applications that incorporate fundamental data structures such as:
- Singly Linked Lists
- Doubly Linked Lists
- Circularly Linked Lists
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 L1 and L2, into a single list L that contains all the nodes of L1 followed by all the nodes of L2. Write a main method to test the new method. Hint: Connect the end of L1 into the beginning of L2.
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 L1 and L2, into a single list L that contains all the nodes of L1 followed by all the nodes of L2. Write a main method to test the new method. Hint: Connect the end of L1 into the beginning of L2.
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 2 images
