COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
push()
|
|
|
pop()
|
|
|
peek()
|
|
|
isFull()
|
|
|
isEmpty()
|
Detailed explanation-1: -push() function is used to insert or ‘push’ an element at the top of the stack.
Detailed explanation-2: -The push() method pushes an element, that is passed as the parameter, on the top of the stack. pop(): The pop() method removes and returns the top element of the stack. An EmptyStackException exception is thrown if we call the pop() method on an empty stack.
Detailed explanation-3: -push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack.
Detailed explanation-4: -Stack push() Method in Java push(E element) method is used to push an element into the Stack. The element gets pushed onto the top of the Stack. Parameters: The method accepts one parameter element of type Stack and refers to the element to be pushed into the stack. Return Value: The method returns the argument passed.
Detailed explanation-5: -In computer science, a stack is an abstract data type that serves as a collection of elements, with two main operations: Push, which adds an element to the collection, and. Pop, which removes the most recently added element that was not yet removed.