Question

5. (34 pts) Stacks and Queues a. Stacks and queues are similar and different. For each of stack and queue, give a drawing showing how each would be stored in an array and a linked list. Use your first name (or usual nickname) as the data put into the container as an example for your pictures. Label the accessible element. (4 pictures; 16 pts) the text and lecture. (10 pts) You will not receive full credit without appropriate stack pictures. You may not use calculators. (8 pts) b. Write Java code for public void add (E entry) for a queue implemented with a linked list as described in c. Use a stack to evaluate the following postfix expression. Show your work so that I can see you are using a stack 73+4542 3 6+

Answer 1

Answer 5:

a)

To ?巾 ㄒㄧ 3 4 TOR ueu e Rean

b)

//method to add element in the queue; element is added at the rear end of the queue

public void add(E entry)

{

Node oldlast = last;

last = new Node();

last.item = entry;

last.next = null;

if (isEmpty())

first = last;

else

oldlast.next = last;

n++;

}

c)

0 M73=1, 2-1 42. 20-6 14

Please give thumbsup, if you like it. Thanks.