[Solved] DataStructure Homework1-Singly-Linked List

You are to code a non-circular singly-linked list with head and tail references. A linked list is a collection of nodes, each having a data item and a reference pointing to the next node. The next reference for the tail/last node in this list will point to null. Do not use a phantom node to represent the start or end of your list. A phantom or sentinel node is a node that does not store data held by the list and is used solely to indicate the start or end of a linked list. If your list contains n elements, then it should contain exactly n nodes.

Your linked list implementation will use the default constructor (the one with no parameter) which is automatically provided by Java. Do not write your own constructor. Specifications for efficiency and what the method should do are provided in the javadocs.

Nodes

The linked list consists of nodes. A class LinkedListNode is provided to you. LinkedListNode has setter and getter methods to access and mutate the structure of the nodes.

Adding

You will implement three add() methods. One will add to the front, one will add to the back, and one will add anywhere in the list. See the javadocs for more details.

Removing

Removing, just like adding, can be done from the front, the back, or anywhere in your linked list. Make sure that you set any remaining pointers to the deleted nodes to null since in order for the node to be garbage collected, there cannot be any way to access the node. See the javadocs for more details.

Equality

There are two ways of defining objects as equal: reference equality and value equality.

Reference equality is used when using the == operator. If two objects are equal by reference equality, that means that they have the exact same memory locations. For example, say we have a Person object with a name and id field. If youre using reference equality, two Person objects wont be considered equal unless they have the exact same memory location (are the exact same object), even if they have the same name and id.

Value equality is used when using the .equals() method. Here, the definition of equality is custom made for the object. For example, in that Person example above, we may want two objects to be considered equal if they have the same name and id.

Keep in mind which makes more sense to use while you are coding. In most cases for this course, you will want to use value equality when comparing objects. A few notable cases where youd use reference equality is when checking for null or when comparing primitives (in this case, its just the == operator being overloaded).

Differences between Java API and This Assignment

Some of the methods in this assignment are called different things in Javas LinkedList class. This wont matter until you tackle coding questions on the first exam, but its something to be aware of. The list below shows all methods with a different name and their Java API equivalent. The format is assignment method name Java API name.

• addAtIndex(int index, T data)add(int index, T data)
• addToFront(T data)addFirst(T data)
• addToBack(T data)addLast(T data)
• removeAtIndex(int index)remove(int index)
• removeFromFront()removeFirst()
• removeFromBack()removeLast()
• indexOf(T data)indexOf(Object data)