{
  SinglyLinkedList.Node temp = new SinglyLinkedList.Node();
  boolean flag = false;
  

   if (fr null) {
  
  temp.data = element;
   fr
        flag = true; 
  }
  
  Node current = front;
  while (!flag) {
   
   //int current.data.compareTo(element) = current.data.compareTo(element);
   //int nextresult = current.next.data.compareTo(element);

   if(current.data.compareTo(element) < 0) {
    
    if (current.next == null) {
     temp.data = element;
     current.next = temp;
     count++;
     flag=true;
    
    }

    
    else if (current.next.data.compareTo(element)>0) {
      temp.data = element;
      temp.next = current.next;
      current.next = temp;
      count++;
      flag = true;
      
    }
    
   }  
   
   
   if (current.data.compareTo(element) > 0) {
    
    
    temp.data = element;
    current.data = (T) temp.data;
    current = temp;
    flag = true;
    count++;
    }
  
   
   if (current.data.compareTo(element) == 0){
    temp.data = element;
    current.data = (T) temp.data;
    current = temp;
    flag = true;
    count++;
   }
   
   return;
  } 
    
    
   }