In the implementation of Singly linked list we had an integer variable called size that keeps track of how many elements in the list Also, we have a reference tail that points to the last node in the list You are asked to re implement the concept of singly linked list without using variable size, and without using reference tail (You need to rewrite the complete class without tail and without count) (JAVA) What are the methods of the main operation of singly linked list that need to be changed Rewrite them according to this change (only the methods that need to be changed) Will that affect the performance of any one of the main operations( size, isEmpty, first, last, addFirst, addLast, removeFirst, removeLast) Explain In the implementation of Singly linked list we had an integer variable called size that keeps track of how many elements in the list Also, we have a reference tail that points to the last node in the list You are asked to re implement the concept of singly linked list without using variable size, and without using reference tail (You need to rewrite the complete class without tail and without count) a) What are the methods of the main operation of singly linked list that need to be changed Rewrite them according to this change (only the methods that need to be changed) b) Will that affect the performance of any one of the main operations( size, isEmpty, first, last, addFirst, addLast, removeFirst, removeLast) Explain w

The Answer is in the image, click to view ...

Answered step by step

Verified Expert Solution

Link Copied!

Question

1 Approved Answer

Posted on Sep 25, 2024

In the implementation of Singly linked list we had an integer variable called size that keeps track of how many elements in the list. Also,

In the implementation of Singly linked list we had an integer variable called size that keeps track of how many elements in the list. Also, we have a reference tail that points to the last node in the list. You are asked to re-implement the concept of singly linked list without using variable size, and without using reference tail. (You need to rewrite the complete class without tail and without count) (JAVA)

What are the methods of the main operation of singly linked list that need to be changed? Rewrite them according to this change (only the methods that need to be changed).

Will that affect the performance of any one of the main operations( size, isEmpty, first, last, addFirst, addLast, removeFirst, removeLast)? Explain.

image text in transcribed

In the implementation of Singly linked list we had an integer variable called size that keeps track of how many elements in the list. Also, we have a reference "tail that points to the last node in the list. You are asked to re-implement the concept of singly linked list without using variable size, and without using reference "tail. (You need to rewrite the complete class without tail and without count) a) What are the methods of the main operation of singly linked list that need to be changed? Rewrite them according to this change (only the methods that need to be changed). b) Will that affect the performance of any one of the main operations( size, isEmpty, first, last, addFirst, addLast, removeFirst, removeLast)? Explain. w