Stacks and Queues as Linked

Question 1

Stack start

Answer 1

public class StackAsMyLinkedList<E> {
MyLinkedList<E> theStack;</E></E>

public StackAsMyLinkedList(){
    theStack = new MyLinkedList<E>();
}

Question 2

push

Answer 2

public void push(E object){
theStack.prepend(object);
}

Question 3

pop

Answer 3

public E pop(){
E temp = null;
boolean isDone = false;
temp = theStack.getFirst();

    if(temp != null){
        isDone = theStack.delete(temp);
    }
    if(isDone){
        return temp;
    }
    else {
        return null;
    }
}

Question 4

stack toString

Answer 4

public String toString(){
return theStack.toString();
}

Question 5

Queue start

Answer 5

public class QeueuAsMyLinkedList<E> {
MyLinkedList<E> theQueue;</E></E>

public QeueuAsMyLinkedList(){
    theQueue = new MyLinkedList<E>();
}

Question 6

enqueue

Answer 6

public void enqueue (E element){
theQueue.append(element);
}

Question 7

dequeue

Answer 7

public E dequeue(){
boolean isDone = false;
E temp;

    temp = theQueue.getFirst();

    if(temp != null){
        isDone = theQueue.delete(temp);
    }
    
    if(isDone){
        return temp;
    }
    else {
        return null;
    }

}

Question 8

O(n) notation

Answer 8

HEAD SIDE TAIL SIDE
Push() O(1) O(1)
Pop() O(1) O(n)