public circularLinkedList(char[] charArray) {
		char firstChar = charArray[0];
		head = new circularLinkedListNode(firstChar);
		nodeCount = 1;
		circularLinkedListNode tail = head;

		for (int i = 1; i < charArray.length; i++) {
			char curChar = charArray[i];
			// if char exists, add loop;
			circularLinkedListNode existNode = itemExistInList(curChar);

			if (existNode != null) {
				tail.next = existNode;
				break;
			} else { // add to end of list
				circularLinkedListNode node = new circularLinkedListNode(
						curChar);
				tail.next = node;
				node.next = null;
				tail = node;
				nodeCount++;
			}
		}
	}