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 tasks performed during postorder traversal?
Does arraylist have index?
Describe binary tree and its property.
Can we add duplicate keys in a hashmap?
When is a binary search best applied?
Define forest?
What is scalar data type?
What is push and pop in stack?
Provide an algorithm to reverse a linked list without using recursion.
What are the advantage of linked list over array?
Which is faster treemap or hashmap?
Explain the priority queue?
What is the minimum number of nodes in an avl tree of height h?
How hashmap increases its size?
What are b tree keys?