Suppose In computer science, a stack is a linear data structure that serves as a collection of elements, with two main principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.
Can we infer that "A stack data structure is characterized by three main operations: insert, delete, and update."? Yes, no, or maybe?