Question

Considering only following stack implementation, complete the function, int cnt(STACK S), which returns the number of elements stored in S. Note that you need to use only class methods given in the following class implementation. Do not implement a new class and/or new class methods. class STACK { private: public: STACK (int); bool empty(); void push (char item); char pop(); }; int cnt (STACK S) {

Answer 1

Here for implementing the cnt function we are assuming that the stack may hav a maximum of 100 elements. so we are takin a char array of size 100. Count variable is initialized to 0. Then unless the stack is empty we are popping from the stack. stroring the element into the array and incrementing count by 1. the finally we get the total number of elements into the count value. we then push the elemnts of the array to the stack again; The elements of the array should be pushed into the stack in reverse order as the top element in the stack was the first element of the array

int cnt(STACK s){

char element[100]; // declaring an array for storing the popped item

int count = 0;

while(!s.empty())

{

element[count] = s.pop();
count++;
}

//pushing array elemnts into the stack in reverse order.

for(int i = count-1; i >=0; i++) {
s.push(element[i]);
}
return count;   

}