public Node reverse(Node head) {
    if (head == null) {
        return head;
	}
	Node iterator = head, prev = null;
    while(iterator.next != null){
        Node tmp = iterator.next;
        iterator.next = prev;
        prev = iterator;
 		iterator = tmp;
    }
    return iterator;
}