Write Java code for extending the LinkedList class of java.util.* to ExtLinkedLi

Question

Write Java code for extending the LinkedList class of java.util.* to ExtLinkedList that includes the following two methods:

public ExtLinkedList oddList()

public ExtLinkedList evenList()

Method oddList() will return a linked list containing the nodes with odd index values, namely, 1,3,5, …etc. and evenList() will return a linked list containing the nodes with even index values namely, 0,2,4,... etc. Your code should work for any size including the empty list and any parameter E and should be as efficient as possible. If the original list contains only one node, then oddList() will return an empty list. Estimate the run-time complexity of the methods assuming the size of the original list is n.

Explanation / Answer

public LinkedList oddList(int n){ LinkedList list = new LinkedList(); for(int i = 1;n>0;i+=2){ list.add(i); n--; } return list; } public LinkedList evenList(int n){ LinkedList list = new LinkedList(); for(int i = 0;n>0;i+=2){ list.add(i); n--; } return list; }

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---