Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 25809 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
What are the types of algorithms?
What is dynamic data structure?
What is difference between tree and binary tree?
Write the algorithm for converting infix expression to postfix expression?
How will you reverse Linked List.
Compare Queue and Topic ?
What is unhashable type list?
Which is better than array and linked list?
How do I use quick sort?
What is time and space complexity of bubble sort?
How to copy an array into another array?
Which is better merge or quick sort?
What is bubble sort used for?
Explain the Linked List
How does the bubble sort work?
