Assuming we are using an array implementation of a stack and not a linked-list implementation.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Assuming we are using an array implementation of a stack and not a linked-list implementation.
Not exactly. You can rather see a stack colletion as a wrapper around an array.
An array is allocated with a fixed size, while a stack grows with the data that is added to it. Generally this is done by allocating a small array initially, and allocate a larger array when the data outgrows the current array.