Implementing all the Stack Operations using Linked List (With Code in C)

preview_player
Показать описание
Stack Operations using Linked List Data Structure: push, pop, isEmpty, peek etc. stack operations can be implemented using Linked list nodes by making it store the head pointer as top of the stack.
This video goes into details of the same!
This video is a part of my data structures and algorithms playlist:

Best Hindi Videos For Learning Programming:

►C Language Complete Course In Hindi -

►JavaScript Complete Course In Hindi -

►Django Complete Course In Hindi -

Follow Me On Social Media
Рекомендации по теме
Комментарии
Автор

Instagram: instagram.com/codewithharry

CodeWithHarry
Автор

Really you are a good teacher, i starrted the course just from the starting of the month of November and today I think that I am some suitable with the dsa problems and making others understand the concept of dsa topics, Thank you harry bhai, love you ...

Roshankumar-fzxs
Автор

Harry Bhai me aapki python series sikh raha hu or apne mere bahut pqise bachaye you very

harshnaidu
Автор

i m new your channel, and bs aate hi fan bn gya

aayushraj
Автор

Best ds algo course ❤ one request plz continue this series and don't stop regular videos🙏🙏🙏

rahuljajodia
Автор

Me ye video esliye like kar rha hu kyuki aapne pura afford lga diya samjane me, Thank you Bhai❤❤

HiteshKumar-fuqj
Автор

I was zero when I started watching c language in april 2023. Today, I feel confident in using c, c++ and data strucrures.Thanks harry bhai. Today is 26 June 2023.

AjinkyaAJJadhav
Автор

You did not teach any concept of global and local variable in 15 hr video but i got this concept from this video thnx for your support 🥰

aniemer
Автор

Harry is one guy who only wants his viewers to learn without expecting anything in return. Unlike these other Youtubers who teach half the thing and force us into buying their paid courses. I wouldn't hesitate to give something to Harry once I start earning. I love you Harry bhai❤️

udaypratapsingh
Автор

So we coded a linked list and called it a stack .

shubhansu-kr
Автор

Bhai great teacher..maine aapki sabhi playlist lagbhag dekh li hai..bhut knowledge mila..thanku

HindiCartoonForYou
Автор

2 years old course but this is the best explanation present anywhere else on yt

devanshverma
Автор

your teaching style is very crystal clear

biswajitadhikary_
Автор

Hats off, your way of teaching is amazing, and implementing it in code is a good way of understanding really appreciate your hard work

MantoManto-vi
Автор

Easily samajh me aa raha hai stack using linked list jaisa topic bhi.... Very helpful videos Sir 👍

anupriyasharma
Автор

bhaiya aur jyaada jyaada videos daalo, bhot maza aa raha and cant wait to get into Compi coding

rcbusinessdwarf
Автор

Thank You Sir ! Your Efforts Are Really Appreciated !!

sajaldwivedi
Автор

Waoh Harry bhai !! 1000 videos complete🔥🔥🔥

tejasjhamnani
Автор

To anyone getting confused with pop function,
we can do the whole stuff without making it complex,
just write the simple pop function and update top in main function.
CODE given below:

struct node* pop(struct node* top)
{
if(isempty(top))
{
printf("Stack Underflow, Can't pop anthing out\n");
}
else
{
struct node* helper = top;
top = top->next;
printf("Popped %d Successfully.\n", helper->data);
free(helper);
return top;
}
}

// in the main function to pop anything just update the top like below
int main()
{

// Whatever prev code is written here
// for popping an element just update top.

top = pop(top);
return 0;

}

rishabhthakur
Автор

struct node * pop (struct node * top){
struct node *n = top ;
top = top->nextpointer;
int data_of_popped = n->data;
free(n);
printf(" the data popped out : %d\n", data_of_popped);
return top;
};

use this for pop . bhaiya kyu top ko global variable banana hai top ko change krke app return bhi kr skte ho

tushuoye