Data structure C + + version-queue

First, the concept

Classification:

Ii. Supplementary Notes

1. "Object-oriented queue design" course questions and Answers:

First, the concept of data structure and data storage structure should be clarified.

Data structure refers to the logical relationship between the objects, such as binary tree, queue, stack, etc., while the data storage structure is a description of how the data is stored on the computer, it is divided into sequential storage and non-sequential storage, and the array is the typical sequential storage.

A linked list is a typical non-sequential store that needs to know the previous data and the latter. A linked list is a way of storing data, which is stored in a non-sequential manner, and a queue is a data structure that can be stored in order or in an order.

2. "Loop Queue Implementation" Course review:
In order to realize the cyclic characteristics of circular queue, the emphasis is on the movement of the tail and the pointer. Therefore, the remainder operation is to allow the pointer to meet the characteristics of the queue loop. The subsequent loop traversal is therefore a bit more flexible.

Data structure C + + version-queue