stack.h: wrapper implemention based on single-linked list class #ifndef STACK-H fde fine STACK-H include "slinked class stack list.h" - public: bool empty int size const return v.size empty) const f return v.empty : void push (const data t &din) v.push front (din) void pop) v.pop front const data t & top ) return v.front private: list v fendi f stack usagel.cpp: basic last-in, first-out example #include "stack . h" int main (int argc, char *argv[]) stack v int value; cout > value) v.push (value) cout