ch 4,5

More restrictive data structure because client can access only a single element at at topmost of the

is a data structure in which only the top element can be accessed.

Storing a data item in a stack is called

Removing a value from a stack is called

behaves like a linked list in which all insertions and deletions are performed at the list head

A stack behaves unlike a linked list in which all insertions and deletions are performed at the list head

A stack behaves like a linked list in which all insertions and deletions are performed at the list head

in stack pointer that point to the first node is called

The stack can be implemented using

allocated array-based implementation