Data structure

Take your time. No rush.

Promise to give u thumbs up.

Please give me the correct answer.

here ,,, list.java is,,,,below

import java.util.Iterator; public interface List { void clear(); int size(); boolean isEmpty(); AnyType get(int index); AnyType set(int index, AnyType newValue); boolean add(AnyType newValue); void add(int index, AnyType newValue); AnyType remove(int index); Iterator iterator(); } 

********* and circular linked list.java is,,,,,,,,,,,,,,,

import java.util.Iterator; import java.util.ConcurrentModificationException; import java.util.NoSuchElementException; public class CircularLinkedList implements List { private static class Node { private AnyType data; private Node next; public Node(AnyType d, Node n) { setData(d); setNext(n); } public AnyType getData() { return data; } public void setData(AnyType d) { data = d; } public Node getNext() { return next; } public void setNext(Node n) { next = n; } } private int theSize; private int modCount; private Node tail; public CircularLinkedList() { } public void clear() { } public int size() { } public boolean isEmpty() { } public AnyType get(int index) { } public AnyType set(int index, AnyType newValue) { } public boolean add(AnyType newValue) { add(size(), newValue); return true; } public void add(int index, AnyType newValue) { } public AnyType remove(int index) { } public void rotate() { } public Iterator iterator() { return new LinkedListIterator(); } private Node getNode(int index) { return (getNode(index, 0, size()-1)); } private Node getNode(int index, int lower, int upper) { } private class LinkedListIterator implements Iterator { private Node previous; private Node current; private int expectedModCount; private boolean okToRemove; LinkedListIterator() { } public boolean hasNext() { } public AnyType next() { } public void remove() { } } } 

Thank you.

Please give me the correct answer,, and i will give u more in the future,,,

thanks,,

Page 1 of 6 Circular Linked List Assignment Overview A circular linked list is essentially a singly linked list in which the next pointer of the tail node is set to point to the head node of the linked list rather than set to nul. The first figure below shows a linked list as a singly linked list. The second figure below shows the singly linked list from the first figure as a circular linked list. In this assignment, you will write code for an implementation of a circular linked list 12 Head Tail Singly Linked List 12 Tail Circular Linked List