Stack can be described as a pointer. Explain.
Answer Posted / kavitha
stack is last in first out property,so lastly pushed
element is poped out first.so when a pointer is pointed it
always points out the head pointer i.e the top element in
the stack.,so stack is also described as pointer.
| Is This Answer Correct ? | 9 Yes | 1 No |
Post New Answer View All Answers
What are the major data structures used in the network data model?
How is a hashset implemented?
What is queue in data structure?
Does hashmap maintain insertion order?
What is the height of a binary tree?
What are the non linear data structure?
What are types of Collision Resolution Techniques and the methods used in each of the types?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Is red black tree balanced?
Is hashmap get thread safe?
How do I rearrange rows in numbers?
Explain the Queue
What is difference between hashmap and arraylist?
Which is faster arraylist or hashmap?
What is the difference between Array and Arraylist?