Stack can be described as a pointer. Explain.
Answer Posted / pramod
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 ca be Described as a Pointer
| Is This Answer Correct ? | 50 Yes | 4 No |
Post New Answer View All Answers
What is the difference between collections class vs collections interface?
Construct a doubly linked list using a single pointer in each node?
What is unbounded queue?
What is linked hash set?
Define collision in hashing?
What is binary search in data structure?
Differentiate linear from a nonlinear data structure?
What is data in computer science?
Define non-linear data structures?
List the differences between comparable and comparator interface?
What are the advantages of linked list?
What are the classification of data structures?
Define indegree of a graph?
Give a real time example of stack
Why arraylist is not efficient for manipulation?