Linked List implementation for stack

We are using a singly linked list with head pointer to implement Stack ADT. The stack top is maintained at the end of the linked list, i.e. stack top is the last item. Discuss whether this is a good design in term of time efficiency:
In a stack of N-items, how fast can you access the stack top? Push or pop?

If we add a tail pointer to the implementation. Is this a good idea looking at:
1. In a stack of N-items, how fast can you get the stack top item?
2. To push or pop an item to an N-items stack, how fast can you do it?

We are using a singly linked list with head pointer to implement Stack ADT. The stack top is maintained at the end of the linked list, i.e. stack top is the last item. Discuss whether this is a good design in term of time efficiency:
In a stack of N-items, how fast can you access the stack top? Push or pop?

If we add a tail pointer to the implementation. Is this a good idea looking at:
1. In a stack of N-items, how fast can you get the stack top item?
2. To push or pop an item to an N-items stack, how fast can you do it?

Linked lists are always the slower option, as all items must be iterated to find the end. A well written hash table or binary map will give you the speed you seem to be looking for.

Hi
sorry didnt read the rules properly..
Well the question is for C++ stacks..

I think that if the stack top is maintained at the end of the linked list, i.e. stack top is the last item, accessing the stack top would take a lot of time, since N items of the linked list need to be traversed before we can access the last item, and push or pop.

However, if we add a tail pointer to the linked list, the implementation will then be efficient, as we can directly access the last item now.
Am I on the right track?

If it's a double linked-list it would make finding items past the half-way node more efficient,if you knew you where specifically looking at the end of the list, but finding an item in the middle would require the same amount of iterations as before. When would you need to specifically access the last item in a linked list?

Hi. so this is actually a continuation from another question of mine[Here](https://www.daniweb.com/programming/software-development/threads/506795/dynamically-add-values-into-datagridview-cell-from-listbox-vb2010) but i was advised to start a new thread as the original question …

I have a 2d matrix with dimension (3, n) called A, I want to calculate the normalization and cross product of two arrays (b,z) (see the code please) for each column (for the first column, then the second one and so on).
the function that I created to find the ...

Write a C program that should create a 10 element array of random integers (0 to 9). The program should total all of the numbers in the odd positions of the array and compare them with the total of the numbers in the even positions of the array and indicate ...