Scribd
Upload
24 views35 pages

DS3 Ss

The document discusses stacks, which are abstract data types with a bounded capacity that allow adding and removing elements in a particular order, with the most recently added element at the top of the stack. Basic features of stacks include being ordered lists of similar data types, operating on a last-in first-out basis using push() and pop() functions, and allowing insertion and deletion only at the top of the stack.

Uploaded by

Sukanya Nagare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views35 pages

DS3 Ss

The document discusses stacks, which are abstract data types with a bounded capacity that allow adding and removing elements in a particular order, with the most recently added element at the top of the stack. Basic features of stacks include being ordered lists of similar data types, operating on a last-in first-out basis using push() and pop() functions, and allowing insertion and deletion only at the top of the stack.

Uploaded by

Sukanya Nagare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 35

INTRODUCTION

Stack is an abstract data type with a bounded (predefined) capacity. It is a simple data structure that
allows adding and removing elements in a particular order. Every time an element is added, it goes on
the top of the stack, the only element that can be removed is the element that was at the top of the
stack, just like a pile of objects

. Basic features of Stack 1. Stack is an ordered list of similar data type. 2. Stack is a LIFO structure. (Last in
First out). 3. push() function is used to insert new elements into the Stack and pop() is used to delete an
element from the stack. Both insertion and deletion are allowed at only one end of Stack called Top. 4.
Stack is said to be in Overflow state when it is completely full and is said to be in Underflow state if it is
completely empty

You might also like