Implementation of a stack data structure, i.e. a list
implementation with LIFO principle.
stack uses a
as default container, so inserting, peeking and popping functions require
constant O(1). See
queue for a class using
the FIFO principle.
C++ object representing a deque
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.