public void insert(Node n) {
		Node current = head;
		boolean flag = false;
		if (n.getData() < current.getData()) { // case 1: new node becomes head
			n.setNext(head);
			head = n;
		}/* if */else {
			while (current.getNext() != null && !flag) {
				if (n.getData() <= current.getNext().getData()) { // case2:
					// insert mode
					// in the
					// middle
					n.setNext(current.getNext()); // Set Fat to point to hat
					current.setNext(n); // Test what would happen if you change
					// current.setNext(n) with
					// n.setNext(current.getNext())
					flag = true;
				}// if(n.getData()<=
				else {
					current = current.getNext();
				}// if/else (n<current.getNext())
			}// while(current.getNext()!=null)
			if (!flag) { // case 3: new node gets appended
				current.setNext(n);
			}
		}// if/else
	}// insert(Node n)