C++ PROGRAM to Implement STACK using SINGLY LINKED LIST | (FULL CODE) | Data structures & Algorithms

preview_player
Показать описание
Support Simple Snippets by Donations -
--------------------------------------------------------------------------------------------- In this tutorial we will write a C++ program to implment Stack using Singly Linked List. We will understand different stack operations with their pseudocode & visual diagrams for best understanding of the individual stack operation code.
Following stack operations using singly linked list will be implemented -
1) push
2) pop
3) peek
4) count
5) isEmpty
6) display

Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

Рекомендации по теме
Комментарии
Автор

Hey Tanmay, you have helped through a really hard times, , , thank u very much
Just wanna make a little request if u kindly make video on topic hash table, trees and graph.
Badly in need of your lecture

alifkhandakar
Автор

Thank you so much bro 😍 due to ur tutorials i got A+ in dSA ..love from pakistan 😍❤❤

muhammadsufyan
Автор

Ah... Mr, thx again for your video. This helps me a lot for my lecture in algorithm

ffann
Автор

Could please make a playlist on C++ Boost Library . Many people are trying to learn it but there's no good videos online.

teetanrobotics
Автор

Thank you!
I solve my problem because of your video

klimm.
Автор

Thank you so much for your dedication towards making these videos! Keep up the good work!

janhavipimplikar
Автор

Thank you so much sir it is very useful in 2021❤️

nizamanitechnical
Автор

1 question. Isnt peek supposed to return the value whose key is being passed? Like for arrays we passed the position we wanted to peek. Wouldnt this work simillarly?

M_Abdullah_Azeem
Автор

thanks brahh for this vedio but why we do not use isfull and change function

eyobmekonnen
Автор

i have learned a lot from this video.
keep uploading

Vishalfsd
Автор

Bhaiya node n1 =new node (). Should give error always beacause new returns a pointer and it should be equal to another pointer variable …?

rajeevdangwal
Автор

I liked the sound effects you added in this video

shivmrjpt
Автор

when we create a new node using a constructor we create a single node in memory right, then how do we use the same node to push multiple times? Wouldn't that overwrite the previous data and next?

AxelWolf
Автор

Thanks for your effort in making these lecture series. Keep it up :-) May God keep blessing you.

MKSundaram
Автор

jani jis din paise kamaye na sab se pehlay apka karz utarun ga, love you ho gaya wadda wadda

LETSTALKABOUTCARS
Автор

bhai ek ek opration leke samja de na ye ek sath bahut difficult hai

akashpinate
Автор

Bro, i think there is no need of variable Key in Stack.

ChandrapalSd
Автор

You upload videos quite late 😀
But the way you deliver and the knowledge and hard work you put on your video seriously overshadow all gaps that you take between uploading 2 videos. 🙂
Amazing content !

manish-mk
Автор

Good job 👍 done
But that's not arrow that's called membership operater (->)

hemnaik