public boolean removeLargest(){
		boolean removed = false;
		Node temp = head;
		Node largest = head;

		while (temp != null){
			if(largest.data < temp.data){
				largest = temp.data;
			}
			temp = temp.next;

		}