Question

A stack can only move or turn? true or false​

Answer 1

Answer:

your aNswer is false hope it help you

Answer 2

A stack can only move or turn? True

Explanation:

• A stack is a linear data structure, elements are stacked on top of each other. Only the last element added can be accessed, i.e the element at the top of the stack. That is, a stack is a Last In First Out (LIFO) structure. This is the opposite of a queue which is First in First out (FIFO). We will see later on that the JavaScript run-time makes use of both of these.

• A common analogy of a data stack is a pile (or stack!) of plates in a canteen; plates are stacked on top of each other. A customer takes a plate from the top. If for some reason they wanted to access the second plate, they would have to remove the top one first.
• A stack will have a maximum size; when this limit is exceeded it is termed “Stack overflow”. This can often be caused when calling a recursive function without properly defining the base or terminating case.