Data Structures with C++ Using STL

Write a function template void stackClear (stack& s); that clears a stack s. Why is it critical that s be passed by reference? Please provide a complete program if it makes sense.

Data Structures with C++ Using STL

List the elements in the queue after each of the following operations: queue intQueue; intQueue.push(18); intQueue.push(2); intQueue.push(intQueue.front()); intQueue.push(intQueue.front()); intQueue.pop(); Please provide a complete program if it makes sense.

Data Structures with C++ Using STL

Declare a stack, queue, and priority queue of integers, as follows: stack s; queue q; priority_queue pq; Assume that you input the integer sequence 5 8 12 15 1 3 18 25 18 35 2 55 and insert each value into each container in the order given. What is the output of the following statements? while (!s.empty()) { cout << setw(5) << s.top() << setw(5) << q.front() << setw(5) << pq.top() << endl; s.pop(); q.pop(); pq.pop(); } Please provide a complete program if it makes sense.

Data Structures with C++ Using STL

Write a function template void n2front (queue& q, int n); that moves the nth element (counting from the front, which is element 1) of the queue to the front, leaving the order of all other elements unchanged. The function throws the rangeError exception if n < 1 or n> q.size(). The figure illustrates the action of n2front() for an integer queue and n = 4. n = 4 (4th element of queue) Before 8 5 17 3 7 front back After 3 8 5 17 7 front back Please provide a complete program if it makes sense.

Data Structures with C++ Using STL

Linked Lists. See attached file for full problem description.