-
Index
- Introduction of Data Structure
- Types Of Data Structures
- Operations Of Data Structures
- Concept Of Abstract Data Type
- Array Part #1
- Array Part #2
- Introduction To Stack
- Operations Of Stack ADT
- Stack Implementation Using Array Part #1
- Stack Implementation Using Array Part #2
- Introduction Of Queue
- Operations Of Queue ADT
- Queue Implementation Using Array Part #1
- Queue Implementation Using Array Part #2
- Circular Queue Implementation Part #1
- Circular Queue Implementation Part #2
- Introduction To Linked Lists
- Array Vs Linked List
- Linked List Implementation Part #1
- Linked List Implementation Part #2
- Linked ListΒ Part #3
- Linked List Part #4
- Linked List Implementation Part #5
- Linked List Implementation Part #6
- Stack Using Linked List Part #1
- Stack Using Linked List Part #2
- Queue Using Linked List Part #1
- Queue Using Linked List Part #2
- Circular Queue Using Linked List
- Implementation Of Doubly Linked List Part #1
- Doubly Linked List Part #2
- Doubly Linked List Part #3
-
Notes
-
Data Structures Viva Question
Introduction To Stack
Introduction To Stack
A stack isΒ an abstract data type that holds an ordered, linear sequence of items. In contrast to a queue, a stack is a last-in, first-out (LIFO) structure. A real-life example is a stack of plates: you can only take a plate from the top of the stack, and you can only add a plate to the top of the stack. A stack is an Abstract Data Type (ADT), commonly used in most programming languages. It is named stack as it behaves like a real-world stack, for example β a deck of cards or a pile of plates, etc. For example, we can place or remove a card or plate from the top of the stack only.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
Prev
Array Part #2