Analyzed and introduced the sequential storage structure of the queue, detailed analyzed several specific methods for the circular queue to resolve the “false overflow”, gave the algorithm descriptions in C of the corresponding basic operations of the queue, compared and analyzed each algorithm the time complexity and the space complexity, so as to complement and play a guiding role in the relevant chapters in “Data Structure” curriculum.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
