Data Structures & Algorithms Lecture Notes

1 October 2009 • Queues


Outline

Restricted Lists

Possibilities

Properties

Element Ordering

The ADT

Adding and Removing Elements

Query Operations

Queue ADT Implementations

List Representation

Array Representation

Element Shifting

Circular-Array Indexing

Queue Comparison

Dequeues

Non-End Access

Priority Queues

Priority-Queue Operations

New Operations

Priority-Queue Implementation

Summary


This page last modified on 1 October 2009.

Creative
    Commons License