void Stack::reverse(){ Stack s; s._top = _top; _top = (Node*)0; while(!s.isEmpty()){ push(s.pop()); } }
reverse()
Leave a comment
void Stack::reverse(){ Stack s; s._top = _top; _top = (Node*)0; while(!s.isEmpty()){ push(s.pop()); } }
Stack(const &Stack){ _top->_next = S._top->_next; }