Reverse a list using Iteration

ReverseSinglyLinkedList.java

	public Node<E> reverseList(Node<E> headList) {

		Node<E> current = headList;
		Node<E> next = null;
		Node<E> result = null;

		while (current != null) {
			next = current.next;
			current.next = result;
			result = current;
			current = next;
		}
		head = result;
		return head;
	}
	
	
		public void reverseListRecursive(Node<E> headList) {
		if (headList == null)
			return;
		Node<E> firstNode = headList;
		Node<E> restNode;
		restNode = firstNode.next;
		if (restNode == null){head = headList;
		return;
		}

		reverseListRecursive(restNode);
		firstNode.next.next = firstNode;
		firstNode.next = null;

		headList = restNode;
	}