public static Node insert(Node head, Node insert) {
		if (head == null && insert != null) {
			head = insert;
			return head;
		}
		if (head == null) {
			return head;
		}
		Node traverse = head;
		while (traverse.info < insert.info && traverse.next != null) {
			traverse = traverse.next;
		}
		insert.next = traverse.next;
		traverse.next = insert;
		return head;
	}