Stack can be described as a pointer. Explain.
- 5 Answers
- 23763 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / mousumi
Because stack will contain a head pointer which will always point to the top of the Stack. All Stack Operations are done using Head Pointer. Hence Stack can be Described as a Pointer
| Is This Answer Correct ? | 6 Yes | 1 No |
Post New Answer View All Answers
How to excel in data structures and algorithms?
Is treemap thread safe?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
Explain linked list in short.
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
Is list same as array?
How can you insert a node to the beginning of a singly linked list?
What is adt in data structure?
What method is used to place a value onto the top of a stack?
What do you mean by collision in hashing?
Define root?
Define union-by-weight?
Does hashmap maintain insertion order?
What are the disadvantages of linear list?
What is the difference between adt and data structure?
