Modify the algorithm from the previous exercise so that it makes use of a rear reference. How does this affect the time complexity of this and the other operations?

What will be an ideal response?

Create a new node containing a reference to the object to be placed on the stack.
Set rear.next to point to the newly created node.
Set rear to point to the newly created node.
Increment the count of elements in the stack.

This algorithm is O(1).