Explain with comments in the code
Can i have implementation stack using linked list
hi @kishoretaru try implementing on your own and I’ll be happy to help if you are stuck anywhere 
It is quite simple, as all the operations can be done on the head of the linked list itself
Can i have implementation of stack using linked list i cant able to figure it out
@kishoretaru i cannot provide the whole code like this…try to write something at least I will add on to it or make changes if there are bugs
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.
can i have implementation of stack using linked list
hello @kishoretaru
it is very easy to implement stack using linked list.
the idea is->
for push operation insert element to start of the list and update head of list
for pop operation simply delete ur head node and make next node as ur head.
for code refer ->this
i want the code which is been explained in vedio stack4 which is been removed
@kishoretaru
logic will remain same bro.
try on ur own, if u face in issue then share the code with me , i will make the required changes
I want code what prateek narang told, inserting and deleting at head one so that complexity at 0(1)
this is for O(1) only.
can i have code for this logic?
@kishoretaru
pls refer my previous have also shared code with same O(1) logic.
if u want code written by prateek bhaiya then pls mail to support -> [email protected]
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.