Process of inserting an element in stack is called:

Question

Accepted Answer

The correct option is (2):
The process of inserting a new element into a stack is fundamentally and universally known as **Push**. The stack is an essential linear data structure that operates based on the Last-In, First-Out (LIFO) principle, meaning the last element added is the first one to be removed. The Push operation is responsible for taking the new data element and adding it to the 'top' of the stack. Conceptually, it involves first checking if the stack is already full (an overflow condition) and, if not, incrementing the stack pointer to reserve space and then placing the element at the new top index. This action is crucial for a stack's function, enabling its use in function calls, expression parsing, and backtracking algorithms.

The incorrect option is (1):
**Create** is the operation used to initialize a data structure, not to insert an element during its active use. This initial action involves allocating the necessary memory space for the stack and setting its starting conditions, such as initializing the 'top' pointer to a specific value (commonly -1 or 0) to signify that the stack is currently empty. While creating the stack is a necessary precursor, it is a one-time setup and does not describe the repeated, dynamic insertion process that occurs throughout the program’s execution. Therefore, 'Create' is a management function distinct from the 'Push' insertion operation.

The incorrect option is (3):
**Evaluation** is a term that describes the calculation of an expression's value, which is a *task* often accomplished *using* a stack. For example, stacks are instrumental in converting mathematical expressions from infix to postfix notation and subsequently calculating the final result of the expression. However, 'Evaluation' is the objective of a broader algorithm. It does not name the specific, low-level operational step of placing a single data item onto the stack structure itself, which is the definition of insertion.

The incorrect option is (4):
**Pop** is the direct complement to the Push operation. This operation is defined as the process of *removing* the topmost element from the stack. Like Push, it first checks for underflow (an empty stack) and then retrieves the element indicated by the 'top' pointer. After retrieval, the pointer is then decremented, conceptually reducing the size of the stack by one. Since the question specifically asks for the process of *inserting* an element, Pop, which is the process of *deleting* or *retrieving* an element, is the logical opposite and thus incorrect.