Ребят, что не так с addByIndex методом? Что я там забываю?

public void addByIndex(int index, int element) {
		int printIndex = index;
		Node newNode = new Node(element);
		Node previous = null;

		if (index == 0) {
			//Provide implementation where the index at which to add an element is 0.
			newNode.next = head; // new node will point to the head (newNode -> head)
			previous = newNode;
			head = newNode;

			//KEEP THIS LINE TO PRINT RESULT!
			System.out.println("Element " + element + " was added at index " + index + ".");

if (counter == printIndex) {
       previous = head;
       head = newNode;
       head.next = previous.next
       previous.next = head;
       break;
}

int counter = 0;
			while(head != null) {
				if (counter == printIndex) {
					 head = newNode;
					 break;
				}
				counter++;
				head = head.next;
			}

if (index == 0) {
			newNode.next = head; // new node will point to the head (newNode -> head)
			head = newNode;
}

//Provide implementation where the index at which to add an element is greater than 0.
			int counter = 0;
			while(counter < index - 1) {
				current = current.next;
				counter++;
			}
			newNode.next = current.next;
			current.next = newNode;

public void addByIndex(int index, int element) {
		int printIndex = index;
		Node newNode = new Node(element);
		Node current = head;

		if (index == 0) {
			//Provide implementation where the index at which to add an element is 0.
			newNode.next = head; // new node will point to the head (newNode -> head)
			head = newNode;

			//KEEP THIS LINE TO PRINT RESULT!
			System.out.println("Element " + element + " was added at index " + index + ".");
		}
		else {
			//Provide implementation where the index at which to add an element is greater than 0.
			int counter = 0;
			while(counter < index - 1) {
				current = current.next;
				counter++;
			}
			newNode.next = current.next;
			current.next = newNode;

			//KEEP THIS LINE TO PRINT RESULT!
			System.out.println("Element " + element + " was added at index " + printIndex + ".");
		}
}

if (index < 1 || index > size)

public void add(int element) {
		Node newNode = new Node(element);

		if (head == null) {
			//Provide implementation where element is added at the head node.
			head = newNode;
		} else {
			Node last = head;
			while (last.next != null) {
				last = last.next;
			}
			last.next = newNode;
		}
	}