Stack is also dynamic memory, without the hassle. Dynamic memory uses poi

Stack can be described as a pointer. Explain.

Question Posted / cse

Answer Posted / cse

Stack is also dynamic memory, without the hassle.
Dynamic memory uses pointers to check its value, free the
memory, etc.

Is This Answer Correct ?

1 Yes

1 No

Please Help Members By Posting Answers For Below Questions

What are two types of sorting?

956

what is Linked lists?

936

Are linked lists considered linear or non-linear data structures?

931

How is hashmap o 1?

813

What is difference between static and dynamic array?

876

What is difference between concurrenthashmap and hashtable?

862

What does each entry in the link list called?

858

What is default array size?

965

Which interfaces are implemented by abstractsequentiallist?

839

Which sorting is used in collections sort?

828

Is vector a collection?

825

How do I sort hashset?

863

Tell me about circular linked list?

890

write a code for Implementation of stack and queues.

930

What is a hashmap in c?

840