Stack is the data structure likely to be used in a non recursive implementation of a recursive algorithm.
Stack is one of the most important data structure and its examples can be easily seen in day to day living. A stack is a form or type of linear data structure( it involves some linear relationships between its elements) that follows a specific order in which operations are performed. The sequence can be LIFO (Last In First Out) or FILO (First In Last Out). LIFO or FILO simply means that insertion or deletion can only be done at one end of the stack. There are many examples of stacking in life. Let's look at the example of plates or dishes stacked on top of each other one by one in a canteen or home.
to know more about Stack, visit
https://brainly.com/question/13707226
#SPJ4
