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
Define indegree of a graph?
When should structures be passed by values or by reference?
Why is hashset used?
What is the difference between hashset and linkedhashset?
Why is sorting important?
Differentiate between file and structure storage structure.
Why is an array homogeneous?
What is binary search tree and explain its time complexity?
Explain quick sort?
Does treemap allow null values?
What do you mean by rehashing?
Differentiate between priorityqueue and treeset.
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Can we insert null in hashset?
Is arraylist heterogeneous?