Stack, Queue and Deque 5.1. Understand the basic operations for Stack, Queue and Deque Example: Suppose that Queue q is implemented by a circular array data with the size 3. Please draw the state of the Queue q and circular array data after each of the following steps. 1) Queue q = new Queue(); 2) q.enqueue(5); 3) q.enqueue (2); 4) q.enqueue (9);

Stack, Queue and Deque 5.1. Understand the basic operations for Stack, Queue and Deque Example: Suppose that Queue q is implemented by a circular array data with the size 3. Please draw the state of the Queue q and circular array data after each of the following steps. 1) Queue q = new Queue(); 2) q.enqueue(5); 3) q.enqueue (2); 4) q.enqueue (9);