/***************************************************************************
* Author: Isai Damier
* Title: Singly Linked List
* Project: geekviewpoint
* Package: datastructure
*
* Description: A LinkedList is a data structure that allows access
* to a collection of data using pointers/references. While an
* array can also be defined as above, LinkedLists and arrays differ
* in how they are stored in memory and in the operations they
* allow. Unlike an array that must be stored in a block of memory,
* the nodes of a LinkedList can be stored anywhere because each
* node has a reference to the node that succeeds it. Because the
* nodes are stored so loosely, inserting nodes into a LinkedList
* is easy; whereas in an array, all the succeeding elements must
* be shifted. Of course, insertion also means changing the size of
* the array, which means creating the entire array anew.
*
* Perhaps the greatest beauty of LinkedList is that it allows
* accessing an entire sequence of nodes using only one variable:
* a reference to the first node in the sequence.
*
* Countless operations can be performed on LinkedLists. Following
* are a few, ranging from the common to the very interesting.
**************************************************************************/
public class SinglyLinkedList {
Node head = null;
Node tail = null;
/*****************************************************************
* Statement:
* Add the given element after the tail of this list
* so that this element becomes the new tail.
*
* Time Complexity of Solution:
* Best = Average = Worst = O(1).
*
* Technical Details: The tail is null only if the head is null.
* Hence, if the tail is null relay the call to addToHead; else
* add the new element to the right of tail and then move the
* tail pointer to the rightmost node on the list.
*****************************************************************/
public void addToTail(int el) {
if (null != tail) {
tail = tail.next = new Node(el);
} else {
addToHead(el);
}
}
}
public class SinglyLinkedListTest {
/**
* Test of addToTail method, of class SinglyLinkedList.
*/
@Test
public void testAddToTail() {
System.out.println("addToTail");
int[] input = {9, 4, 5, 2, 1, 12, 6, 7, 4, 8, 3, 0, 16, 19, 11, 17, 13};
SinglyLinkedList linkedList = new SinglyLinkedList();
for (int i = 0; i < input.length; i++) {
assertEquals(i, linkedList.size());
linkedList.addToTail(input[i]);
}
int ndx = 0;
for (Node n = linkedList.head; null != n; n = n.next) {
assertEquals(input[ndx++], n.data);
}
assertEquals(input.length, ndx);
}
}