Interested to Buy Any Domain ? << Click Here >> for more details...
Stack can be described as a pointer. Explain.
- 5 Answers
- 25785 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
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
List the applications of set adt?
List some applications of multilinked structures?
What is the time complexity of arraylist and linked list?
Give a real time example of stack
How to reverse a linked list iterative algorithm?
Write the disadvantages of separate chaining?
What is array sort?
Tell me what should be done in the base case for this recursive problem?
What is height balanced tree?
Which interfaces are implemented by enumset?
What do you mean by double hashing?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
What do u mean by data type?
What is a height of a tree?
