Data may be stored as sorted list.

This is B-tree.

This is stack.

The order of element read is first-in-first-out.

Element with highest priority is at the top of data structure for fast access.

The order of element read is last-in-first-out.

Data may be stored in heap tree.