Can the storage method of stack and queue be either sequential or chained?
The storage method of stacks and queues can be either sequential or chained.
Because stacks and queues are a kind of data structure, as long as the properties of stacks and queues are met, sequential storage or chain storage can achieve the purpose.
Stacks and queues are data stored in a specific range of storage units, and these data can be retrieved and used again. The difference is that the stack is like a very narrow bucket. The data stored first can only be taken out last, and the queue is different, that is, "first in, last out". The queue is a bit like the daily "queue" of people queuing up to buy things. People in the queue first buy first, and people in the queue last buy last, that is, "first in, first out". Sometimes there may be data queues in the data structure that are queued according to size or according to certain conditions. At this time, the queue is a special queue, and the data may not be read according to the "first in, first out" principle.
The above is the detailed content of Can the storage method of stacks and queues be either sequential or linked?. For more information, please follow other related articles on the PHP Chinese website!