Bounded stack of integers C++
<p>Hey, just doing some revision for upcoming exams and i'm looking at a past paper.</p>

<p>I'm asked to write the class implementation for this:</p>

<pre><code>class Stack
{
    public:
        Stack(int n=1);
        int pop();
        void push(int);
        int isEmpty();
        int isFull();
        ˜Stack();
    private:
        int top; // index of element at top of stack
        int size; // maximum number of elements storable
        int * cell; // pointer to elements stored in stack
};
</code></pre>

<p>I understand the theory of stacks and i know what the methods have to do, the bit that confuses me is where are the integers that are passed to the stack stored, and how is this done? Maybe im missing something realy simple but im stumped?</p>
