Gnerics problem with Comparator

Question

i have to creat a program which deals with LinkedList...but I'll creat my own list which its name is "InOrderLinkedList"
it's function is to take numbers and put them in the right order node
i made 2 codes but one of them has an error (which i think it's about Generic Comparator Problem)
and the other code doesn't have any error...but doesn't do any thing when i run it
first code is:_
import java.util.Collections;
import java.util.List;
import java.util.*;
import java.util.Iterator;
import java.util.ListIterator;
import java.lang.Integer;
import java.lang.Object;
import java.lang.*;
import javax.swing.*;
class Node<E>{
          E item_;
          Node nextNode_=null;
          public void setItem(E item){
               item_=(E)item;
          public Node<E> getNextNode(){
               return nextNode_;
          public void setNextNode(Node nextNode){
               this.nextNode_=nextNode;
          public String toString(){
               return item_.toString();
          E getItem(){
               return (E)item_;
/*interface Comparator<E>{
     public int compareTo(E e1,E e2);
class Comp implements Comparator <Integer>{
     public int compare(Integer e1,Integer e2){
     return e1-e2;
class LinkedListme<E>{
     Node<Integer> head;
     Node<Integer> tail;
     int size=0;
     public void addFirst(int e){
          /*Node<E> node= new Node<E> (e);
          node.setNextNode(head);
          head=node;
          size++;*/
     public void addLast(int e){
          /*Node<E> node=new Node<E> (e);
          if(head==null){
               head=node;
               size++;
               return;*
          Node<E> lastNode=head;
          while(lastNode.getNextNode()!=null){
               lastNode=lastNode.getNextNode();
          lastNode.setNextNode(node);*/
     public void clear(){
          head=null;
          size=0;
     public int removeFirst(){
          Node<Integer> firstNode=head;
          head= head.getNextNode();
          size--;
          return firstNode.getItem();
     public int removeLast(){
          if (size==1)
               return removeFirst();
          if (size==0)
               return 0;
          Node<Integer> secondLast=head;
          Node<Integer> lastNode=null;
          while(secondLast.getNextNode().getNextNode()!=null){
               secondLast=secondLast.getNextNode();
          lastNode=secondLast.getNextNode();
          secondLast.setNextNode(null);
          size--;
          return lastNode.getItem();
     public int remove(int index){
          Node<Integer> beforeRemoved=head;
          Node<Integer> removed=null;
          for(int i=1;i<(index-1);i++){
               beforeRemoved=beforeRemoved.getNextNode();
          removed=beforeRemoved.getNextNode();
          beforeRemoved.setNextNode(removed.getNextNode());
          return removed.getItem();
     public void add(int index,int x){
          /*Node<E> beforeAdd=head;
          Node<E> newNode=new Node<E> (x);
          for(int i=1;i<(index-1);i++){
               beforeAdd=beforeAdd.getNextNode();
          newNode.setNextNode(beforeAdd.getNextNode());
          beforeAdd.setNextNode(newNode);*/
     /*public void prnt(LinkedListme<E> l){
          System.out.print(l);
public class InOrderLinkedList <E> extends LinkedListme<E>{
     public void add (int elem){
          Node <Integer> newNode = new Node <Integer>();
          newNode.setItem(elem);
          if(head==null){
               head=newNode;
               tail=newNode;
               newNode.setNextNode(head);
               head=newNode;
//public class LinkedListme {
public static void main(String[]args){
     InOrderLinkedList <Integer> list=new InOrderLinkedList <Integer>();
     Comp com=new Comp();
     list.add(5);
     list.add(5);
     list.add(3);
     list.add(6);
     list.add(3);
     list.add(2);
     list.add(1);
     Collections.sort(list,com); ///here is the error
     System.out.println(list.toString());
the second code is:_
import java.util.*;
import java.util.Iterator;
import java.util.ListIterator;
import java.lang.Integer;
import java.lang.*;
import javax.swing.*;
class Node<E>{
          E item_;
          Node <E>nextNode_=null;
          public void setItem(E item){
               item_=(E)item;
          public Node<E> getNextNode(){
               return nextNode_;
          public void setNextNode(Node <E>nextNode){
               this.nextNode_=nextNode;
          public String toString(){
               return item_.toString();
          E getItem(){
               return (E)item_;
/*interface Comparator<E>{
     public int compareTo(E e1,E e2);
class Comp implements Comparator <Integer>{
     public int compare(Integer e1,Integer e2){
     return e1-e2;
class LinkedListme<E>{
     Node<Integer> head;
     Node<Integer> tail;
     int size=0;
     public void addFirst(int e){
          /*Node<E> node= new Node<E> (e);
          node.setNextNode(head);
          head=node;
          size++;*/
     public void addLast(int e){
          /*Node<E> node=new Node<E> (e);
          if(head==null){
               head=node;
               size++;
               return;*
          Node<E> lastNode=head;
          while(lastNode.getNextNode()!=null){
               lastNode=lastNode.getNextNode();
          lastNode.setNextNode(node);*/
     public void clear(){
          head=null;
          size=0;
     public int removeFirst(){
          Node<Integer> firstNode=head;
          head= head.getNextNode();
          size--;
          return firstNode.getItem();
     public int removeLast(){
          if (size==1)
               return removeFirst();
          if (size==0)
               return 0;
          Node<Integer> secondLast=head;
          Node<Integer> lastNode=null;
          while(secondLast.getNextNode().getNextNode()!=null){
               secondLast=secondLast.getNextNode();
          lastNode=secondLast.getNextNode();
          secondLast.setNextNode(null);
          size--;
          return lastNode.getItem();
     public int remove(int index){
          Node<Integer> beforeRemoved=head;
          Node<Integer> removed=null;
          for(int i=1;i<(index-1);i++){
               beforeRemoved=beforeRemoved.getNextNode();
          removed=beforeRemoved.getNextNode();
          beforeRemoved.setNextNode(removed.getNextNode());
          return removed.getItem();
     public void add(int index,int x){
          /*Node<E> beforeAdd=head;
          Node<E> newNode=new Node<E> (x);
          for(int i=1;i<(index-1);i++){
               beforeAdd=beforeAdd.getNextNode();
          newNode.setNextNode(beforeAdd.getNextNode());
          beforeAdd.setNextNode(newNode);*/
     /*public void prnt(LinkedListme<E> l){
          System.out.print(l);
public class InOrderLinkedList <E> extends LinkedListme<E>{
     Comp com=new Comp();
     public void add (int elem){
          Node <Integer> newNode = new Node <Integer>();
          newNode.setItem(elem);
          if(head==null){
               head=newNode;
               tail=newNode;
          if(com.compare(head.getItem(), elem)>=0){
               newNode.setNextNode(head);
               head=newNode;
               return;
               Node<Integer> lastNode=head;
               //Integer lastNodeInt=(Integer)lastNode;
          int compVal=com.compare(lastNode.getItem(), elem);
          while(compVal<0 && lastNode.getNextNode()!=null){
               lastNode=lastNode.getNextNode();
          if(lastNode.getNextNode()==null){
               lastNode.setNextNode(newNode);
          tail=newNode;     
          else{
               newNode.setNextNode(lastNode.getNextNode());
               lastNode.setNextNode(newNode);
//public class LinkedListme {
public static void main(String[]args){
     InOrderLinkedList <Integer> list=new InOrderLinkedList <Integer>();
     list.add(5);
     list.add(9);
     list.add(3);
     list.add(6);
     list.add(3);
     list.add(2);
     list.add(1);
     System.out.println(list.toString());
what are thier problems??
thanks

Answer 1

So what's the error message?