A circular queue is a limited-capacity queue implemented in an array in such a way that when the head and tail of the queue reaches the end of the array, it wraps around to the beginning of the array again. There are three different ways of making this wrapping action happen. Please start with the Queue code from the lecture notes and write three versions of Queue::append( BT value )

1. Use an if statement.

2. Use a conditional expression. 3. Use the % operator.

AT&T 42% 9:33 AM eliza.newhaven.edu Nice E. Fscher A 13 of 22 2-3 Here we see the back position wrap around. q.push( d'); q push eq.push('f ); 8 count front 2 o 21 13] [4] [5] 6] 171 Data Structures LS Queues 13/22 Lecre 5 Queus 2018 1 Circular Quaues A Circular Queue 4 Here we see the front position wrap around q pop) q.pop) q popi q.pop q-pop) q.push('g' q push h q.pop) q pop) max count front back data ? g ? 8 2 3 ? AT&T 42% 9:33 AM eliza.newhaven.edu Nice E. Fscher A 13 of 22 2-3 Here we see the back position wrap around. q.push( d'); q push eq.push('f ); 8 count front 2 o 21 13] [4] [5] 6] 171 Data Structures LS Queues 13/22 Lecre 5 Queus 2018 1 Circular Quaues A Circular Queue 4 Here we see the front position wrap around q pop) q.pop) q popi q.pop q-pop) q.push('g' q push h q.pop) q pop) max count front back data ? g ? 8 2 3