Question

(Data Structure)

Using only emptyCheck(), peek(), push(a), and pop() operations, write a function Middle(Stack S) that returns the value from stack S that is in the middle, (i.e., location [size / 2]). You may create additional stacks as needed, but S must be restored by the end of the routine.

Answer 1

function Middle(Stack S){
   Stack st;
   int n=0;
   int mid;
   while(S.empty() == false){
       st.push(S.peek());
       s.pop();
       n++;
   }
  
   for(int i=1;i<=n;i++){
       if(i==n/2){
           mid = st.peek();
           st.pop;
       }
       else{
           S.push(st.peek);
           st.pop();
       }
   }
   return mid;
}