Match the abstract data types to its purposes

A. Queues

B. Doubly Linked Lists

C. Hash Tables

D. Binary Trees

E. Stacks

1. Keeping track of definitions associated with symbols (e.g. foo <- function (x)...)

2. representing parsed expressions so you can convert inorder expressions such as "x+y" into the postorder sequence "xy+" needed by your hardware

3. Keeping track of active subprocedure calls to be continued

4. Keeping track of the order in which programs should be run

5. Can be used to implement many of the other ADTs on the list