A stack is usually represented by a block of memory cells, with the "bottom" at a fixed location, and the stack pointer holding the address of the current "top" cell in the stack. This video explains an application of stack in procedure calling and methods to work on stack are explained
Contents are taken from the book Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni.
Previous videos :
Data Structures and Algorithms
1. Why to learn data structures and algorithms :
What is the necessity to learn Data Structures and Algorithms - https://youtu.be/9EBfybbQHys
2. Overview of Data Structures and Algorithms :
Definition of Data Structures, Examples Data Structure Definition of Computer Science as the study of data structures - https://youtu.be/IMbznXvbAO8
3. Axiomatization :
Array representation of ordered list of Polynomial, Polynomial addition, Fibonocci Polynomial - https://youtu.be/yV6DWitCQsw
@learnwithsamu
