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

• Linked List
• Array
• Stack
• Queue

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

• Array
• Linked List
• Stack
• Queue

Storing a data item in a stack is called

• enqueueing
• peeking
• popping
• pushing

Removing a value from a stack is called

• pushing

• enqueue
• popping

• dequeue

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

• Stack
• Hash Table
• Array
• Queue

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

• True

• False

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

• True

• False

in stack pointer that point to the first node is called

• base
• root
• head
• top

The stack can be implemented using

• Queue
• Tree
• Hash Table
• Array or Linked List

allocated array-based implementation

• statically

• dynamically