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
11 ай бұрын
@@anonymouscse6433😂😂
@danishabbasofficially
11 ай бұрын
Yes of course... I'm from Pakistan I can't afford a package of Neso App but this channel helped me a lot.
@qwertypwnown
2 жыл бұрын
One of the best teachers on the internet! Many thanks.
@nandinirm2234
2 жыл бұрын
Best explanation I love the background ....pleasant for eyes and font size ....everything perfect
@computer_tech98
8 ай бұрын
The best explanation for the begginer student and also it looking best❤ thank you sir
@sheelkumarigupta5273
3 жыл бұрын
Please upload the series soon.i need to study.your way of teaching is amazing.. I'm requesting plz upload as soon as possible
@Ankittiwari-yk8ix
2 жыл бұрын
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
@Mr_Memer01_
Жыл бұрын
What an explanation ❤🎉 Sir I've viva and practical tomorrow Thanks sirji ❤️
@ahiamatagabriel5696
2 жыл бұрын
God bless neso academy
@Sovit705
2 жыл бұрын
why don't do they like this video? Please motivate the maker of the contents for a wonderful presentation of the topics.
@phanikumarsimhadri8124
Жыл бұрын
Excellent Explanation
@hereyoursdad
2 жыл бұрын
very very good insight especially when i was confused that where the head will be define i got resolutions thanks
@satyamrana5462
3 жыл бұрын
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.
@sakshikarale6758
3 жыл бұрын
Plz upload the videos as soon as possible... Thanks for this series and it is superb.
@dipeshsamrawat7957
3 жыл бұрын
I love Neso Academy :)
@rahufkhan9076
3 жыл бұрын
Please complete the playlist. Upload the video regularly sir please...
@bilalmohammad4242
Жыл бұрын
thank you man, it was an awesome explanation!
@vaibhavkurale5016
3 жыл бұрын
Data structure series complete hobe mai kitane din lag jayenge🙏
@suyashkumar8840
3 жыл бұрын
2 saal
@JohnDoe-kj2cs
2 жыл бұрын
@@suyashkumar8840 bs
@nikhilsastry6631
2 жыл бұрын
7months
@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
@accessdenied9393
3 жыл бұрын
Keep up, sir
@Lil-Diva
Жыл бұрын
Tysm sir💜
@thefattyguitarist6623
2 жыл бұрын
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)
@sumedhraut1853
3 жыл бұрын
Please upload the next video's as soon as possible sir...
@RahulSingh-yx8rw
3 жыл бұрын
First comment , I'm waiting for this video. thank u so much👍
@AlameenAdeyemi
5 ай бұрын
i just had to comment man, kudos
@parvahuja7618
Жыл бұрын
thankyou neso love you
@sandeepgharusandeepgharu8269
Жыл бұрын
Brilliant 👌
@sivasaile5163
2 жыл бұрын
You guys are truly amazing ❤️
@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) ...
@souvikmidya8233
3 жыл бұрын
Please sir complete the playlist . I am watching the playlist for last 5 months and it's still going on.
@rajeshprajapati4863
3 жыл бұрын
Do not ask for the quick completion. Just leave it as it is.
@HopeNHopes
3 ай бұрын
الحمدالله للوجود النسو آکادمی 🤞😗
@sangramganta4265
5 ай бұрын
sir please upload next data structures lectures please sir
@gagansalian807
7 ай бұрын
good one😄
@johanliebert675
Жыл бұрын
Pov:you have exam tomorrow
@rajeshprajapati4863
3 жыл бұрын
❤️❤️❤️
@rajatshimpi455
8 ай бұрын
do we only need to learn SINGLY LINked list for this chapter or do i need to know all like circular ,doubly etc ???
@bushrahussain3005
6 ай бұрын
Top== NULL can be top== -1
@CodeShode
2 жыл бұрын
how is time complexity of adding at the end of a singly linked list is constant. Isn't it O(n)?
@collegematerial5348
2 жыл бұрын
yes you are right
@gamingwithindian8492
2 жыл бұрын
because the top pointer always pointing to last node of the list
@monjurulkabir8959
3 ай бұрын
Yes it should be O(n)
@zainabrehman-w7e
3 ай бұрын
Yes because in stack the top always represent the last node@@gamingwithindian8492
@zainabrehman-w7e
3 ай бұрын
We are discussing stack here not simple linkedlist
@anshurajsinghranawat6732
3 жыл бұрын
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 ❤
@adityabhattad4614
Жыл бұрын
What if we maintain pointer to second last element, the problem will be easily solved... isn't it?
@divinechijindu7465
6 ай бұрын
Have a tail pointer and make your life a bit easier?
Пікірлер: 70