What is a dynamic data structure?

Changes in form include:

• changes in size as data items are added or removed
• changes in structure as links between data items are added or removed

The main drawback of dynamic data structures is that they consumeextra resources:

• extra memory space to store
• extra processing steps to manipulate

Examples of dynamic data structures:

Resizable array

linked list

tree

fila

graph

pilha

The List ADT

A List is an abstract data type that can contain items of the same type, ordered by their position in the list.

O ADT define o o que pode ser feito, mas não como.

The following is a typical set of operations on lists:

• create a new (empty) list
• add an item to the list
• search for an item
• remove the item at a given position