This is the souce code for Stacks, but it has errors. Please update this without errors and warnings.
This is the souce code for Stacks, but it has errors. Please update this without errors and warnings.
template<class T>
bool Stack<T>::isConsecutive(const T & data) const
{
size_t p = _top - 2;
cout<<(p+1>0)<<p<<endl;
for (size_t i = _top - 2; i + 1 > 0; i--) {
cout << elements[i]<<" "<<elements[i+1]<<endl;
if (elements[i] == data && elements[i] == elements[i + 1]) return true;
}
return false;
}
template<class T>
void Stack<T>::reverse()
{
T* temp = new T[_capacity];
size_t tail = _top;
for (size_t i = 0; i < tail; ++i) {
cout<<i<<" "<<peek()<<endl;
temp[i] = pop();
cout<<i<<" temp "<<temp[i]<<endl;
}
delete[] elements;
elements = temp;
_top = tail;
cout<<" elements "<<elements[0]<<endl;
}
Given template for reverse and isConsecutive, we will simply update this removing error part and ensure it will give no errors or warnings. Below is solution header file:-non required lines
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
