Chapter 8, Problem 18CRP

Explanation of Solution

Function to eliminate bottom entry:

Procedure RemoveBottomElem()

{

if(original stack non empty) then

{

while(original stack non empty) do

{

Pop entry from original stack

Push it to auxiliary stack;

}

}

Pop entry from auxiliary stack;

while(auxiliary stack non empty) do

{

Pop entry from auxiliary stack

Push it to original stack;

}

}

Explanation:

• The code first checks whether original stack is empty or not.
• If stack is non-empty, it enters the loop until it becomes empty.
• An entry is popped from original stack, it is been pushed into auxiliary stack
• The operation is repeated until original stack becomes empty.
• Once original stack becomes empty, auxiliary stack has elements in reverse order of original stack.
• The element at bottom of original stack will be at top of auxiliary and hence required element is at top of auxiliary stack...