| Data Structures |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Now
let’s examine various data structures |
||||||||||||
| for
a queue and discuss the efficiency |
|||||||||||||
| tradeoffs,
based on: |
|||||||||||||
| – | run-time
performance |
||||||||||||
| – | memory
usage |
||||||||||||
| • | We
will examine: |
||||||||||||
| – | statically/dynamically
allocated arrays |
||||||||||||
| – | “circular”
arrays |
||||||||||||
| – | linked
lists (linear, circular, doubly) |
||||||||||||