Is the stack a first-in-first-out linear list?

The stack is not a first-in, first-out linear list, but a first-in, last-out linear list. The end of the stack that allows insertion and deletion operations is called the top of the stack, and the other end is the bottom of the stack. The bottom of the stack is fixed and the top of the stack is floating. When the number of elements in the stack is zero, it is called an empty stack.

The stack is not a first-in, first-out linear list, but a first-in, last-out linear list.

What is a stack?

Stack (stack), also known as stack, is a linear table with limited operations. A linear table that restricts insertion and deletion operations only to the end of the table. This end is called the top of the stack, and the other end is called the bottom.

Inserting a new element into a stack is also called pushing, pushing or pushing. It is to put the new element on top of the top element of the stack to make it the new top element of the stack; delete it from a stack Element is also called popping or popping off the stack. It deletes the top element of the stack and makes its adjacent elements become the new top elements of the stack.

A stack is a special linear list that allows insertion and deletion operations at the same end.

The end of the stack that allows insertion and deletion operations is called the top of the stack (top), and the other end is the bottom of the stack (bottom); the bottom of the stack is fixed, and the top of the stack floats; the number of elements in the stack is Time zero is called an empty stack. Insertion is generally called PUSH, and deletion is called popping (POP). Stack is also called first-in-last-out list.

The above is the detailed content of Is the stack a first-in-first-out linear list?. For more information, please follow other related articles on the PHP Chinese website!