a) A collection of stacks is sortable
b) Stack entries may be compared with the ‘<‘ operation
c) The entries are stored in a linked list
d) There is a Sequential entry that is one by one
Answer: d
Explanation: In stack data structure, elements are added one by one using push operation. Stack follows LIFO Principle i.e. Last In First Out(LIFO).
Related Posts
The time complexity of converting a prefix notation to infix notation is _________
When converting the prefix notation into an infix notation, the first step to be followed is ________
Given a prefix and a postfix notation what are the difference between them?
What would be the solution to the given prefix notation?
* / + 1 2 / 4 2 + 3 5What would be the solution to the given prefix notation?
– * 1 5 / * / 6 3 6 2What would be the solution to the given prefix notation?
– + 1 2 * 3 / 6 2What would be the solution to the given prefix notation?
+ 9 * 3 / 8 4
Join The Discussion