In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and. pop, which removes the most recently added element that was not yet removed.Stacks entered the computer science literature in 1946, when Alan M. Turing used the terms “bury” and “unbury” as a means of calling and returning from subroutines.[3] Subroutines had already been implemented in Konrad Zuse’s Z4 in 1945.
source code: https://github.com/procodistdotcom/Data-Structure-Algorithm/blob/master/Stack.c
Instructor: Ashik
Related Posts
Cameraman: Himel
Fb page : https://www.facebook.com/procodist/
https://www.facebook.com/groups/programming.learn
source
