Which of the following methods inserts an element into a stack data structure? A. enqueue B. dequeue C. push D. pop E. peek

In the context of data structures, particularly stacks, it's important to understand the operations that can be performed. A stack follows the Last In, First Out (LIFO) principle, meaning that the last element added to the stack will be the first one removed.

1. Understanding Stack Operations:

   • Push: This operation adds an element to the top of the stack.
   • Pop: This operation removes the element from the top of the stack.
   • Peek: This operation allows you to view the top element of the stack without removing it.
   • Enqueue and Dequeue: These operations are associated with queue data structures, not stacks. Enqueue adds an element to the back of the queue, while dequeue removes an element from the front of the queue.

2. Identifying the Correct Option:

   • Since the question asks specifically about inserting an element into a stack, we are looking for the operation that adds to the stack.

Final Answer

The correct method that inserts an element into a stack data structure is C. push.