C + +, stacks and queues

1, header file

#include <stack>

#include <queue>

2, statement

Stack<int> stacktest;

Queue<int> queuetest;

3, Common function operation

(1) Stack

S.empty () returns               true if the stack is empty, otherwise returns Falses.size () returns the                number of elements in the stack s.pop ()                 removes the top element of the stack without returning its value s.top ()                 returns the element at the top of the stack, But does not delete the element S.push () pushes                a new element at the top of the stack

(2) Queue

Q.empty () returns               true if the queue is empty, otherwise returns Falseq.size () returns the                number of elements in the queue Q.pop ()                 deletes the first element of the queue but does not return its value Q.front ()               returns the value of the first element of the team, But do not delete the element Q.push ()                at the end of the team press into the new element Q.back ()                returns the value of the tail element of the queue, but does not delete the element

C + +, stacks and queues