CSC $326$ Data Structures $($C$++$ Programming Language$)$

Hw$1$: Implementing Templated class Stack with Dynamic Array and Linked Nodes

Problem $1$: max total $40$ points

a$)$ Design $($write the prototype $-5$ points$)$ and implement $($write the definition $-15$ points$)$ of a new templated member function reverse for the templated class DStack. $h$ on dynamic array. $($max $20$ points$)$

$//$ DStack.h

template $$ class ItemType $>$

class Stack

f public:

Stack$($int numElements $=128$;

$$ Stack $()$;

Stack$($const Stack& stack$1$;

Stack stack$2$;

The statement

stack$1.$reverse$(stack2)$;

copies the elements $of$ stack $1$ onto stack $2in$ reverse order. That $is,$ the top element $of$ stackl $is$ the bottom element $of$ stack$2,$ and $soon.$ The old content $of$ stack$2is$ destroyed and stackl $is$ unchanged.

$b>$ & original