What are the basic operations of stack?
- 1 Answers
- 1004 Views
- I also Faced
- E-Mail Answers
Answer / Mohd Waseem Akram
The basic operations of a stack are Push (add element), Pop (remove element), Peek (view top element without removing it), and Check Empty.
| Is This Answer Correct ? | 0 Yes | 0 No |
Can arraylist contain null?
What are priority queues?
Explain linear linked implementation of Stack and Queue?
Discuss how to implement queue using stack.
Is arraylist fail fast?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Will hashmap allow null keys?
What is a b+ tree? Explain its uses.
Which is better bubble sort or selection sort?
How hashmap increases its size?
What are the main differences between the linked list and linear array?
What is the best case for bubble sort?
Windows 
