Stack/Queue

Question 1

Time Complexity for Stack and Queue:

Answer 1

Depending on implementation:
if a resizeable array:
Queue
Retrieval O(N)
Search O(N)
Insertion O(1)
Deletion O(1)
Stack
Retrieval O(N)
SearchO(n)
InsertionO(1)
deletion O(1)

Question 2

What is FIFO

Answer 2

First in first out. Queues use this principle to be implemented in. The first value entered in the queue will be retrieved while the most recent entry is at the end.

Question 3

What is LIFO

Answer 3

Last in First Out. Stacks implement this. The first value entered will be the last value removed if other entries are entered. Example, a stack of papers.