Question

Discuss why we never encounter overflow condition in linked list implementation​

Answer 1

Answer:

Doing a stack implementation as a list would result in slower performance (because allocation/deallocations will have to be done more often), even more convoluted if you consider that differently-sized chunks of memory have to be allocated on stack. Stack is used so extensively that any slow-down in its implementation would probably be prohibitive.