EJERCICIO 7- COLA CON LISTA

public class ColaConLista <E> implements Queue <E>{

protected Position <E> L;

public ColaConLista ......... (ni la mas puta idea como hacer el constructor) jajajajaja

public void enqueue(E e){

      addLast(e);}
public E dequeue() throws EmptyQueueException{

         if(L.isEmpty())
             throw new EmptyQueueException;
    return remove(L.first());
}

public E front() throws EmptyQueueException{

        if(L.isEmpty())
             throw new EmptyQueueException;

    return (L.first());
}
public boolean isEmpty(){
      return(L.isEmpty());
}

public int size(){
    return L.size();}
}

-----------------------------------------------------------------------------------------------------------------------------------
EJERCICIO 10 COLAS DE PILAS, ES DE ORDEN N??????????????????????????????

public Queue COrdenado (Queue <Character> cin1, Queue<Character> cin2) throws EmptyQueueException{

Queue<Character> salida=new ColaConArregloCircular<Character>(cin1.size()+cin2.size());

if((cin1.isEmpty())&&(cin2.isEmpty())
 throw new EmptyQueueException("Cola Vacia");

while((!cin1.isEmpty())&&(!cin2.isEmpty()){
      if(c1.front()=>c2.front()){
           salida.enqueue(c2.front())
           cin2.dequeue();}
      else{
         salida.enqueue(c1.front());
         c1.dequeue();}
}

if(cin1.isEmpty()){
   while(!cin2.isEmpty()){
        salida.enqueue(cin2.front());
        cin2.enqueue();}
}
if(cin2.isEmpty()){
   while(!cin1.isEmpty()){
        salida.enqueue(cin1.front());
        cin1.dequeue();}
}
return salida;
}
---------------------------------------------------------------------------------------------------------------------------
EJERCICIO 11- PILA DE PILASSSSS (SI NO SE ENTENDIO LA IDEA TE MANDO MI SUPER TRAZA JAJAJA )

public Stack PilaDeEnteros(Stack<Integer>PPE) throws EmptyStackException{ (tengo duda en el parametro como poner que es pila de pila de enteros porque asi como lo puse yo seria pila de enteros nomas)

Stack<Integer> aux= new PilaArreglo<Integer>(PPE.size());
Stack<Integer> salida= new PilaArreglo<Integer>(PPE.size());

if(PPE.isEmpty())
 throw new EmptyStackException("Pila Vacia");

while(!PPE.isEmpty()){

Stack<Integer> pila=PPE.pop();

while(!pila.isEmpty()){
aux.push(pila.pop());
}

}

while(!aux.isEmpty()){

salida.push(aux.pop());}

return salida;
}