-
Index 32
-
Lecture1.1
-
Lecture1.2
-
Lecture1.3
-
Lecture1.4
-
Lecture1.5
-
Lecture1.6
-
Lecture1.7
-
Lecture1.8
-
Lecture1.9
-
Lecture1.10
-
Lecture1.11
-
Lecture1.12
-
Lecture1.13
-
Lecture1.14
-
Lecture1.15
-
Lecture1.16
-
Lecture1.17
-
Lecture1.18
-
Lecture1.19
-
Lecture1.20
-
Lecture1.21
-
Lecture1.22
-
Lecture1.23
-
Lecture1.24
-
Lecture1.25
-
Lecture1.26
-
Lecture1.27
-
Lecture1.28
-
Lecture1.29
-
Lecture1.30
-
Lecture1.31
-
Lecture1.32
-
-
Notes 1
-
Lecture2.1
-
-
Data Structures Viva Question 6
-
Lecture3.1
-
Lecture3.2
-
Lecture3.3
-
Lecture3.4
-
Lecture3.5
-
Lecture3.6
-
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