wrapper for each element containing a pointer to the previous and next node is high overhead ## FixedStack - Stack implementation with a (compile-time) fixed upper bound for the number of elements it can heap allocations for small amount of small objects ## FixedStack template class FixedStack { public: FixedStack& Push(const T& element); ElementContainer Pop();