Stack in Data structure | Data Structures and Algorithms | DSA Full Course | Coding With Clicks

preview_player
Показать описание
Stacks in Data Structures are a type of linear data structure that adheres to the LIFO (Last-In-First-Out) principle and allows insertion and deletion operations from the top end of the stack data structure. The stack can be implemented using contiguous memory, which is an array, or non-contiguous memory, which is a linked list. Stack is essential in many applications.
The stack data structure is a linear data structure that follows the LIFO (Last In First Out) or FILO principle (First In Last Out). A deck of cards, piles of books, piles of money, and many other real-life examples of stacks exist. This example enables you to perform operations from only one end of the stack, such as inserting and removing new books from the top of the stack. This means that in the stack data structure, insertion and deletion can only be performed from the top of the stack. At any given time, you can only access the top of the stack. Some operations that are implemented on the stack are as follows. push operation, pop operation, peek operation.
A push operation is when a new element is added to the stack.
The removal or deletion of elements from the stack is referred to as a pop operation. The push operation involves the addition of new elements to the stack. Because you only have one end to insert a unique element on top of the stack, it places the new element on top of the stack.
Because you only have one end to do all top of the stack, the pop operation refers to removing the element from the stack again. As a result, removing an element from the top of the stack is referred to as a pop operation.
The peek operation refers to retrieving the topmost element in the stack without removing it from the data element collections. The isFull function determines whether or not a stack is empty. The isEmpty function determines whether or not a stack is empty.

#stackindatastructure #whatisstackindatastructure #stackdatastructure #datastructurestack #stack #datastructure #datastructureandalgorithm #datastructures #datastructuresandalgorithms #dsa #dsafullcourseinhindiplaylist #c++dsa #dsainc++ #dsafullcourse #datastructurestutorials #ADT #stackADT #stackvsqueue #stackoperations #implementationofstack #introductiontostack #algorithms #stackimplementationinc++ #dsa #dsanotes #codingwithclicks #coding #with #clicks
Рекомендации по теме
Комментарии
Автор

Best explaination in the world kuch din baad paper hai aur bht zabedast samajh aa rahi hai

oldestsong
Автор

thank you dear plz continue your channel your videos are very helpful for us

Tekkenrankedmatches
Автор

mai chandighar university mai padta hu and maujhe jab ye channel mila na i got releif bohut asani se samaj ata hai and agar dyan de to pata chalta hai unique teacjing tecnq istemaal kiya aapne thank u.

easyaeronautics
Автор

Nice video.I'm covering my data structure syllabus with the help of your videos.. ❤️

THIS_IS_MY_LIFEE
Автор

I am enjoying your videos Your teaching method is Good.

techapproachonline
Автор

Assalam-u-alaikum ma'am, thank you so so much for the video. Your aesthetic slides and teaching style simplified my uni course, easing my depression. Grateful!

NoorAli-jlgd
Автор

mam bahot easily understand ho rha hai.

fqtksbu
Автор

Please implement it through all options e.g array, linkedlists, etc

bushrahussain
Автор

Really appreciating your videos best of luck in future

danishhassan
Автор

may allah give you success in every moment of life . Outstanding ❤❤❤❤

relatedtoislam__u
Автор

video is excllent, but i am bit confused, the pop function is just decrementing the top variable, it is not actually removing an element from stack

kashif
Автор

mam you have python lecture like this.

askariwaqar
Автор

Mam please stack implementation lecture upload kr daine please

Fatima_mughal
Автор

Mam please start your video with "Jay shree Ram" 🚩🚩

mayankkandwal
Автор

Please implement it through all options e.g array, linkedlists, etc

bushrahussain
Автор

Please implement it through all options e.g array, linkedlists, etc

bushrahussain