LIFO - Last In First Out - last item added is the first item popped out
- Enqueue - Add item to queue
- O(1)
- Change next property of the last node to the value of the node being added
- Reassign rear reference to the new node
- Dequeue - remove item from queue
- O(1)
- Removes front node
- Check IsEmpty First
- Create a Temporary reference named temp and point it towards the fist node.
- Reassign front to the second node in the stack.
- Reassign next propery on temp node to null.
- Return vlue of temp Node
Home