listClasses

Class BasicLinkedList<T>

java.lang.Object

listClasses.BasicLinkedList<T>

All Implemented Interfaces:

java.lang.Iterable<T>

public class BasicLinkedList<T>
extends java.lang.Object
implements java.lang.Iterable<T>

This generic singly-linked list relies on a head (reference to first element of the list) and tail (reference to the last element of the list). Both are set to null when the list is empty. Both point to the same element when there is only one element in the list. A node structure has only two fields: data and next reference. The class must only define the following entities: a class Node, head and tail references and an integer representing the list size. All the entities are defined as protected so they can be accessed by a subclass.

Author:

Dept of Computer Science, UMCP

Constructor Summary

Constructors

Constructor and Description
BasicLinkedList() Defines an empty linked list.

Method Summary

Modifier and Type	Method and Description
BasicLinkedList<T>	addToEnd(T data) Adds element to the end (tail) of the list.
BasicLinkedList<T>	addToFront(T data) Adds element to the front (head) of the list.
T	getFirst() Returns but does not remove the first element from the list.
T	getLast() Returns but does not remove the last element from the list.
int	getSize() Notice you must not traverse the list to compute the size.
java.util.Iterator<T>	iterator() This method must be implemented using an anonymous inner class that defines the iterator.
BasicLinkedList<T>	removeAllInstances(T targetData) Removes ALL instances of targetData from the list.
T	retrieveFirstElement() Removes and returns the first (head) element from the list.
T	retrieveLastElement() Removes and returns the last (tail) element from the list.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

BasicLinkedList

public BasicLinkedList()

Defines an empty linked list. No nodes are created.

Method Detail

getSize

public int getSize()

Notice you must not traverse the list to compute the size. This method just returns the value of the instance variable you use to keep track of size.

Returns:

list size

addToEnd

public BasicLinkedList<T> addToEnd(T data)

Adds element to the end (tail) of the list. Do not use iterators to implement this method.

Parameters:

data - element to be added

Returns:

reference to current object

addToFront

public BasicLinkedList<T> addToFront(T data)

Adds element to the front (head) of the list. Do not use iterators to implement this method.

Parameters:

data - element to be added

Returns:

reference to current object

getFirst

public T getFirst()

Returns but does not remove the first element from the list. If there are no elements the method returns null. Do not implement this method using iterators.

Returns:

data element or null

getLast

public T getLast()

Returns but does not remove the last element from the list. If there are no elements the method returns null. Do not implement this method using iterators.

Returns:

data element or null

retrieveFirstElement

public T retrieveFirstElement()

Removes and returns the first (head) element from the list. If there are no elements the method returns null. Do not implement this method using iterators.

Returns:

data element or null

retrieveLastElement

public T retrieveLastElement()

Removes and returns the last (tail) element from the list. If there are no elements the method returns null. Do not implement implement this method using iterators.

Returns:

data element or null

removeAllInstances

public BasicLinkedList<T> removeAllInstances(T targetData)

Removes ALL instances of targetData from the list. Notice that you must remove the elements by performing a single traversal over the list. You may not use any of the other retrieval methods associated with the class in order to complete the removal process. Do not implement this method using iterators.

Parameters:

targetData - element to be removed

Returns:

reference to current object

iterator

public java.util.Iterator<T> iterator()

This method must be implemented using an anonymous inner class that defines the iterator. Remember that we should be able to call the hasNext() method as many times as we want without changing what is considered the next element. Only students in the honor section will implement the iterator's remove() method. If you don't need to implement the iterator's remove() method, throw UnsupportedOperationException.

Specified by:

iterator in interface java.lang.Iterable<T>

Returns:

iterator