1. Give the full implementation of an accessor method that returns the second item from the top of the stack without actually changing the stack. Write separate solutions for the two different stack versions.
2. For the linked list version of the stack, do we maintain references to both the head and the tail?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here