Is the circular queue a non-linear structure?

The circular queue is a non-linear structure.

Data structures are divided into linear structures and non-linear structures. Queues and linear tables are both linear structures.

A linear table is a finite sequence composed of n data elements. The sequence has a unique "first" and a unique "last" data element; in addition to the "first" and "last" In addition, each data element in the sequence has only one direct predecessor and one direct successor.

Insertion and deletion operations in linear tables can be performed anywhere in the table.

The queue is a special linear table. The special thing is that it only allows deletion operations at the front end of the table (front), and insertion operations at the back end (rear) of the table. Just like the stack, A queue is a linear list with restricted operations.

The end that performs the insertion operation is called the tail of the queue, and the end that performs the deletion operation is called the head of the queue.

When there are no elements in the queue, it is called an empty queue.

The data elements of the queue are also called queue elements.

Inserting a queue element into the queue is called enqueuing, and deleting a queue element from the queue is called dequeuing.

Because the queue only allows insertion at one end and deletion at the other end, only the element that enters the queue earliest can be deleted from the queue first, so the queue is also called FIFO—first in first out. Linear table.

For more technical articles related to frequently asked questions, please visit the FAQ column to learn more!

The above is the detailed content of Is the circular queue a non-linear structure?. For more information, please follow other related articles on the PHP Chinese website!