Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 25804 Views
- Wipro, I also Faced
- E-Mail Answers
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
Name the areas in which you can apply data structures extensively?
What thread means?
do records fall under linear or non linear data structures?
Define right-in threaded tree?
Does hashmap allow null keys?
What is difference between tree and forest?
What type of variable is age?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
how to insert a new node in linked list where free node will be available?
How do you sort an array by value?
What is a spanning tree in data structure?
What do you mean by balanced trees?
What is fibonacci search?
State the demerit of linear representation of binary trees?
What are the applications of linked list?
