1.

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

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.



Discussion

No Comment Found