COMPLEJIDAD IMPRIME

                                                                         //O(1)
    public void imprime(NodoBin<T> n) {  //T=2+2+1+MAX(1,0)+2+MAX(3,0)+2+MAX(3,0)+7+2+MAX(2,0)+2+MAX(2,0) = 5+1+2+3+2+3+9+2+2+2 = 31
        T l = null;                                                             //2
        T r = null;                                                             //2
        if(n==null)                                                             //1+MAX
            return;                                                             //1
        if(n.getIzq()!=null) {                                                  //2+MAX
         l = n.getIzq().getInfo();                                              //3
        }
        if(n.getDer()!=null) {                                                  //2+MAX
         r =n.getDer().getInfo();                                               //3
        }                                           
        System.out.println("NodoIzq: "+l+"\t Info: "+n.getInfo()+"\t NodoDer: "+r);//7
        if(n.getIzq()!=null) {                                                  //2+MAX
         imprime(n.getIzq());                                                //2
        }
        if(n.getDer()!=null) {                                                  //2+MAX
         imprime(n.getDer());                                                 //2
        }
    }
T=2+2+1+MAX(1,0)+2+MAX(3,0)+2+MAX(3,0)+7+2+MAX(2,0)+2+MAX(2,0)
T=5+1+2+3+2+3+9+2+2+2 = 31

T=31

O(1)