Write a Java class myLinkedList to simulate a singly linked list using arrays as the underlying structure. Include the following methods: 1. insert an element within the linked list.(this should also work for the front and the rear of the list) 2. Remove an element from the linked list 3. Display (print) the elements of the linked list in order. 4. A method to check if the list is "empty". Test your solution using a linked list that initially has the characters A, B, D, E, F, and G. Insert "C" between B and D. Remove element "F". [Hint: One solution (recommended) is to use 2 arrays. One for the data, and the other for the "next" pointer. Also, consider using dummy nodes for the front, and possibly the rear of the list] Extend the solution so that it simulates a doubly linked list! (hint: You will need a third array to represent the "backward" pointers)
Write a Java class myLinkedList to simulate a singly linked list using arrays as the underlying structure. Include the following methods:
1. insert an element within the linked list.(this should also work for the front and the rear of the list)
2. Remove an element from the linked list
3. Display (print) the elements of the linked list in order.
4. A method to check if the list is "empty".
Test your solution using a linked list that initially has the characters A, B, D, E, F, and G. Insert "C" between B and D. Remove element "F".
[Hint: One solution (recommended) is to use 2 arrays. One for the data, and the other for the "next" pointer. Also, consider using dummy nodes for the front, and possibly the rear of the list]
Extend the solution so that it simulates a doubly linked list! (hint: You will need a third array to represent the "backward" pointers)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
