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 are the advantages of linked list over array (static data structure)?
What does map stand for?
What is stable sorting?
What is difference between capacity and size of arraylist?
What are basic algorithms?
How many parts are there in a declaration statement?
what are the applications that use Linked lists?
What is array and its types in data structure?
How null key is handled in hashmap?
What is the need for priority queue?
Write is a binary search tree? Write an algorithm and tell complexity?
What is storage structure in data structure?
Define primary data structures?
What is the maximum size of array?
Differentiate bfs and dfs?