Data Structure & Algorithum java program Do the following: 1) Add a constructor to the class "LList" that creates a list from a given array of objects. 2) Add a method "addAll" to the "LList" class...

Data Structure & Algorithum java program

Do the following:

1) Add a constructor to the class "LList" that creates a list from a given array of objects.
2) Add a method "addAll" to the "LList" class that adds an array of items to the end of the list. The header of the method is as follows, where "T" is the generic type of the objects in the list.
3) Write a Test/Driver program that thoroughly tests all the methods in the class "LList".

= 1) && (givenPosition <= number0fentries))="" {="" 57="" 58="" if(givenposition="=" 1)="" {="" result="firstNode" =="" firstnode.getnextnode();="" }else=""> nodeBefore = Node nodeToRemove = nodeBefore.getNextNode(); Node nodeAfter result = nodeToRemove.getData(); nodeBefore.setNextNode(nodeAfter); 59 60 61 firstNode.getData(); 62 63 64 getNodeAt (givenPosition - 1); 65 66 nodeToRemove.getNextNode(); 67 68 69 number0fEntries++; return result; } else { throw new IndexOut0fBoundsException ("Illegal position given."); 70 71 72 73 74 } 75 7660 A 77 @Override public void clear() { whlutlllAuto-aenerated method stub I. 78 79 80 81 82e A 83 84 85 @Override public T replace(int givenPosition, T newEntry) { if((givenPosition >= 1) && (givenPosition <= number0fentries))="" {=""> desiredNode = T originalEntry = desiredNode.getData(); desiredNode.setData(newEntry); return originalEntry; } else { throw new IndexOut0fBoundsException ("Illegal position given"); getNodeAt (givenPosition); 86 87 88 89 %3D 90 01 Problems @Javadoc Declaration Console X No consoles to display at this time. "/>
Extracted text: number0fEntries++; } else { throw new Index0ut0fBoundsException ("Illegal position given."); 48 49 50 51 } 52 53 54 550 A 56 @0verride public T remove (int givenPosition) { T result = null; if((givenPosition >= 1) && (givenPosition <= number0fentries))="" {="" 57="" 58="" if(givenposition="=" 1)="" {="" result="firstNode" =="" firstnode.getnextnode();="" }else=""> nodeBefore = Node nodeToRemove = nodeBefore.getNextNode(); Node nodeAfter result = nodeToRemove.getData(); nodeBefore.setNextNode(nodeAfter); 59 60 61 firstNode.getData(); 62 63 64 getNodeAt (givenPosition - 1); 65 66 nodeToRemove.getNextNode(); 67 68 69 number0fEntries++; return result; } else { throw new IndexOut0fBoundsException ("Illegal position given."); 70 71 72 73 74 } 75 7660 A 77 @Override public void clear() { whlutlllAuto-aenerated method stub I. 78 79 80 81 82e A 83 84 85 @Override public T replace(int givenPosition, T newEntry) { if((givenPosition >= 1) && (givenPosition <= number0fentries))="" {=""> desiredNode = T originalEntry = desiredNode.getData(); desiredNode.setData(newEntry); return originalEntry; } else { throw new IndexOut0fBoundsException ("Illegal position given"); getNodeAt (givenPosition); 86 87 88 89 %3D 90 01 Problems @Javadoc Declaration Console X No consoles to display at this time.


Extracted text: Lijava 44 A 3 import chapter10.ListInterface; 4 Unit13 src src chapter12 O LList ► o firstNode: Node 5 public class LList implements ListInterface { 6. private NodeT firstNode; private int number0fEntries%; 8 6. public LList( { firstNode = null; number0fEntries = 0; } 100 11 12 %3D 13 14 private Node getNodeAt (int givenPostion) { Node currentNode = firstNode; for (int count = currentNode = currentNode.getNextNode(); } return currentNode; 150 16 %3D 17 1; count < givenpostion;="" count++)="" {="" 18="" 19="" 20="" 21="" 22="" 23e="" a="" 24="" @override="" public="" void="" add(t="" newentry)="" {=""> newNode = new Node<>(newEntry); if(isEmpty()) firstNode = newNode; else { Node lastNode = lastNode.setNextNode (neWNode); 25 26 27 28 29 30 31 32 33 34 35e A 36 37 38 39 40 41 42 getNodeAt (number0fEntries); number0fEntries++3; I @Override public void add(int givenPosition, T newEntry) { if(givenPosition >= 1 && (givenPosition <= number0fentries="" +="" 1))="" {=""> newNode = new Node<>(newEntry)%3; if(givenPosition = 1) { newNode.setNextNode(firstNode); firstNode = newNode; Jelse { Node nodeBefore = getNodeAt (givenPosition - 1); Node nodeAfter = nodeBefore.getNextNode(); newNode.setNextNode(nodeAfter); nodeBefore.setNextNode(newNode) : %3D 43 44 %3D 45 46 Problems @ Javadoc Declaration Console X No consoles to display at this time.