An array-based list which grows on demand.
When the internal array is full, a new array of twice the size will be
allocated and the items are copied over.
This list can also be used as a stack.
Have look at list_push(), list_pop() and list_peek().
An array-based list which grows on demand.
When the internal array is full, a new array of twice the size will be
allocated and the items are copied over.
This list can also be used as a stack.
Have look at list_push(), list_pop() and list_peek().
An array-based list which grows on demand.
When the internal array is full, a new array of twice the size will be
allocated and the items are copied over.
This list can also be used as a stack.
Have look at list_push(), list_pop() and list_peek().
An array-based list which grows on demand.
When the internal array is full, a new array of twice the size will be
allocated and the items are copied over.
This list can also be used as a stack.
Have look at list_push(), list_pop() and list_peek().