Assertion: queue's element | /r/CapableOf | push into stack
Facets:
Source sentences:
text: The stack data structure follows the "First In Last Out" policy (FILO) where the first element inserted or "pushed" into a stack is the last element that is removed or "popped" from the stack.
text: The third popped element is assigned to op1 Evaluate op1 op op2 Convert the result into character and push into the stack
text: The first element, usually at the zero offset, is the bottom resulting in array being the first element pushed onto the stack and the last element popped off.