Data structure: the definition and operation of stacks and queues

First, stack and queue definitions

1), Stack

Defined:

Stacks (stack) is a linear table of LIFO (last into first Out,lifo) that requires deletion and insertion only at the end of the table.

The figure is as follows:

Characteristics:

First, the stack of special linear table (sequential table, linked list), it has some special requirements and restrictions on the operation: the stack elements must be "LIFO first."

Third, the stack of the end of the stack is called Stack top, the corresponding table header called Stack bottom (bottom)

The operation of the stack can only be done at the end of the linear table.

2), queue

Defined:

Queues are special linear tables that qualify to be inserted at one end of a table and delete at the other end of the table.

The figure is as follows: