COMPLEJIDAD INSERTAR ORDENADO

                                                                                //O(n)
    public void insertarOrdenado(T info){          //T=3+6+max(1+1)+3+3+5+E(7)+1+max(1,2+1+1+2+3)
        Comparable x=(Comparable)(info);                                        //3
        if(this.esVacia()|| x.compareTo(this.cabeza.getInfo())<=0){             //6-
            this.insertarAlInicio(info);                                        //1
            return;                                                             //1
        }                                                       
        NodoD<T> nuevo=new NodoD<T>(info, null, null);                          //3
        NodoD<T> p=this.cabeza;                                                 //3
                                                                        
        for(;(p!=null && x.compareTo(p.getInfo())>=0); p=p.getSig()){}          //5+E(7)
        if(p==null)                                                             //1-
            this.insertarAlFinal(info);                                         //1
        else{                                                                   //
            nuevo.setAnt(p.getAnt());                                           //2
            nuevo.setSig(p);                                                    //1
            p.setAnt(nuevo);                                                    //1
            nuevo.getAnt().setSig(nuevo);                                       //2
            this.tamanio++;                                                     //3
        }
    }
    

T = 3+6+2+3+3+5+7n+1+9 = 32+7n = n

O(n)