Linked List Implementation of Stacks (Part 1)

[@gurappagateacademy5618]

I am mechanical students l got AIR 6th rank in GATE PI . 11 times I qualified GATE. l did my M Tech from IIT Madras. This year I am writing GATE CSE. Neso academy vedios is better than other online source for GATE aspirants as my opinion. Thank you so much.

[@anonymouscse6433]

Bhai videos hota edited karke bhi galat hai 11 times qualified

[@Uknwnwizard]

11 times 😂

[@saaranshjain9618]

Bro became father before going for M Tech 🤣🤣

[@studymaterial6465]

​@@anonymouscse6433😂😂

[@danishabbasofficially]

Yes of course... I'm from Pakistan I can't afford a package of Neso App but this channel helped me a lot.

[@qwertypwnown]

One of the best teachers on the internet! Many thanks.

[@nandinirm2234]

Best explanation I love the background ....pleasant for eyes and font size ....everything perfect

[@sheelkumarigupta5273]

Please upload the series soon.i need to study.your way of teaching is amazing.. I'm requesting plz upload as soon as possible

[@Sovit705]

why don't do they like this video? Please motivate the maker of the contents for a wonderful presentation of the topics.

[@computer_tech98]

The best explanation for the begginer student and also it looking best❤ thank you sir

[@Ankittiwari-yk8ix]

we can also form a dynamically allocate array...during the run time we can input the size of the array. so we do have not to worry about the size of the array.

[@amandawanaprinceh1058]

very true. the reason given for why we need a linked list vs an array for the stack was not valid. During the run time also we can dynamically allocate the array size.

[@net.navigator]

the main idea behind the linked list is that we can use memory not only in a contiguous fashion. for extreme sets of data, allocating continuous memory is not a great idea to go with. yes you can realloc array and add size dynamically but in the linked list the data can be stored in available memory cells during run time and the storage need not be continuous

[@hereyoursdad]

very very good insight especially when i was confused that where the head will be define i got resolutions thanks

[@Mr_Memer01_]

What an explanation ❤🎉 Sir I've viva and practical tomorrow Thanks sirji ❤️

[@sakshikarale6758]

Plz upload the videos as soon as possible... Thanks for this series and it is superb.

[@ahiamatagabriel5696]

God bless neso academy

[@satyamrana5462]

Thank You So Much Neso Academy, Please Keep Making Videos You Are Really Doing a Great Job. I found such a great explanation of all these topics here.

[@rahufkhan9076]

Please complete the playlist. Upload the video regularly sir please...

[@phanikumarsimhadri8124]

Excellent Explanation

[@dipeshsamrawat7957]

I love Neso Academy :)

[@timacorn2536]

if there was a doubly linked list we could have top as the end pointer right? since we can always go back and set it to the 2nd last pointer

[@Lil-Diva]

Tysm sir💜

[@sumedhraut1853]

Please upload the next video's as soon as possible sir...

[@accessdenied9393]

Keep up, sir

[@sivasaile5163]

You guys are truly amazing ❤️

[@bilalmohammad4242]

thank you man, it was an awesome explanation!

[@thefattyguitarist6623]

But what if while pushing a node into linkedlist we keep track of both top and previous top (by another pointer variable) And then push This will reduce time complexity to O(1)

[@brijeshkumarverma1223]

starts at : 4:48

[@bushrahussain3005]

Top== NULL can be top== -1

[@gandhamprakash]

for example i want to delete the firstly created node in the list(stack operation at begining of list),it also take O(n) ...

[@kowshik-gu7cw]

Time complexity of inserting an element at the end in linked list also order of N because this also traverse to insert

[@parvahuja7618]

thankyou neso love you

[@souvikmidya8233]

Please sir complete the playlist . I am watching the playlist for last 5 months and it's still going on.

[@rajeshprajapati4863]

Do not ask for the quick completion. Just leave it as it is.

[@sandeepgharusandeepgharu8269]

Brilliant 👌

[@HopeNHopes]

الحمدالله للوجود النسو آکادمی 🤞😗

[@AlameenAdeyemi]

i just had to comment man, kudos

[@RahulSingh-yx8rw]

First comment , I'm waiting for this video. thank u so much👍

[@vaibhavkurale5016]

Data structure series complete hobe mai kitane din lag jayenge🙏

[@suyashkumar8840]

2 saal

[@JohnDoe-kj2cs]

@@suyashkumar8840 bs

[@nikhilsastry6631]

7months

[@gagansalian807]

good one😄

[@rajatshimpi455]

do we only need to learn SINGLY LINked list for this chapter or do i need to know all like circular ,doubly etc ???

[@CodeShode]

how is time complexity of adding at the end of a singly linked list is constant. Isn't it O(n)?

[@collegematerial5348]

yes you are right

[@gamingwithindian8492]

because the top pointer always pointing to last node of the list

[@monjurulkabir8959]

Yes it should be O(n)

[@zainabrehman-w7e]

Yes because in stack the top always represent the last node​@@gamingwithindian8492

[@zainabrehman-w7e]

We are discussing stack here not simple linkedlist

[@sangramganta4265]

sir please upload next data structures lectures please sir

[@adityabhattad4614]

What if we maintain pointer to second last element, the problem will be easily solved... isn't it?

[@johanliebert675]

Pov:you have exam tomorrow

[@junaidnaik-pu7dp]

RCB❤❤❤

[@vaibhavinakate9755]

When the next video is coming

[@rajeshprajapati4863]

❤️❤️❤️

[@anshurajsinghranawat6732]

But sir STACK use LIFO property and in the linked list represention first node print in first so how stack property is true in linked list represention Thank you ❤

[@Bad_Agent]

5:38

[@divinechijindu7465]

Have a tail pointer and make your life a bit easier?

[@saikiran2596]

1:10

[@saikiran2596]

2:18

[@vaibhavkurale5016]

1 st view😁

[@vaibhavkurale5016]

Write a code/ program in your each video program🙏

[@AHABBAKA252727]

HA HA HA HA