Introduction to Stack l Stack Operations -Push Pop | Applications of Stack | DSA using Java #18
17.3 هزار بار بازدید -
3 سال پیش
-
Introduction to stack:A stack is
Introduction to stack:
A stack is an abstract data type that serves as a collection of elements, with two main principal operations
Push, which adds an element to the collection
Pop, which removes the most recently added element that was not yet removed.
The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out). Additionally, a peek operation may give access to the top without modifying the stack. The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other. This structure makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first
Considered as a linear data structure, or more abstractly a sequential collection, the push and pop operations occur only at one end of the structure, referred to as the top of the stack. This data structure makes it possible to implement a stack as a singly linked list and a pointer to the top element. A stack may be implemented to have a bounded capacity. If the stack is full and does not contain enough space to accept an entity to be pushed, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack
Applications of stack:
There are many real-life examples of a stack. Consider the simple example of plates stacked over one another in a canteen. The plate which is at the top is the first one to be removed, i.e. the plate which has been placed at the bottommost position remains in the stack for the longest period of time. So, it can be simply seen to follow LIFO/FILO order.
Implementation of stack:
There are two ways to implement a stack:
stack Using array
stack Using linked list
Topics discussed(Technical Interview Questions):
Introduction to Stack
Applications of Stack
Stack operations
Push and Pop in Stack
Implementation of stack
stack in data structure
stack operations
Hands on Data Structures Training
Data Structures Overview
Stack Data Structure Tutorial
Data structure tutorials
what is stack in data structure
Data Structures Overview
Data Structures Interview Questions
Use my code deepali10 to get 10% discount
Career as a Developer: https://unacademy.com/goal/career-as-...
Reach for the Stars: https://bit.ly/Unacademy-Deepali-Soft...
Link to Data structure using Java Playlist:
Data Structure using Java
Join the Telegram Group for interview preparation material and updates:
https://t.me/formyscholarsdeepali
You can also reach me at:
Instagram: Instagram: formyscholarsdeepali
LinkedIn: LinkedIn: formyscholarsdeepali
#formyscholars #DSA #datastructure
For Online/Offline Training & Business Enquiry:
Email-id: [email protected]
Disclaimer: The information given in this video is as per my research and knowledge. Kindly do your research also before taking any step to go further.
A stack is an abstract data type that serves as a collection of elements, with two main principal operations
Push, which adds an element to the collection
Pop, which removes the most recently added element that was not yet removed.
The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out). Additionally, a peek operation may give access to the top without modifying the stack. The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other. This structure makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first
Considered as a linear data structure, or more abstractly a sequential collection, the push and pop operations occur only at one end of the structure, referred to as the top of the stack. This data structure makes it possible to implement a stack as a singly linked list and a pointer to the top element. A stack may be implemented to have a bounded capacity. If the stack is full and does not contain enough space to accept an entity to be pushed, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack
Applications of stack:
There are many real-life examples of a stack. Consider the simple example of plates stacked over one another in a canteen. The plate which is at the top is the first one to be removed, i.e. the plate which has been placed at the bottommost position remains in the stack for the longest period of time. So, it can be simply seen to follow LIFO/FILO order.
Implementation of stack:
There are two ways to implement a stack:
stack Using array
stack Using linked list
Topics discussed(Technical Interview Questions):
Introduction to Stack
Applications of Stack
Stack operations
Push and Pop in Stack
Implementation of stack
stack in data structure
stack operations
Hands on Data Structures Training
Data Structures Overview
Stack Data Structure Tutorial
Data structure tutorials
what is stack in data structure
Data Structures Overview
Data Structures Interview Questions
Use my code deepali10 to get 10% discount
Career as a Developer: https://unacademy.com/goal/career-as-...
Reach for the Stars: https://bit.ly/Unacademy-Deepali-Soft...
Link to Data structure using Java Playlist:
Data Structure using Java
Join the Telegram Group for interview preparation material and updates:
https://t.me/formyscholarsdeepali
You can also reach me at:
Instagram: Instagram: formyscholarsdeepali
LinkedIn: LinkedIn: formyscholarsdeepali
#formyscholars #DSA #datastructure
For Online/Offline Training & Business Enquiry:
Email-id: [email protected]
Disclaimer: The information given in this video is as per my research and knowledge. Kindly do your research also before taking any step to go further.
3 سال پیش
در تاریخ 1400/06/12 منتشر شده
است.
17,365
بـار بازدید شده