The one thing that is amazing in your lectures sir, that you explain the logic of every piece of code: How that works and all...I salute you for that Sir 🙏
Sir please please make complete playlist of linked list. You are the only one who made me to understand data structure Please sir make complete playlist of linked list.
Funny when i made the code it felt very difficult, now when you explained this, it doesn't sound so difficult. Will have to tryout this code for different cases. Thanks a lot
Sir awesome content! Good work Sir, you are proving all your haters wrong by bringing such awesome content. Kudos and hope you complete it soon! May God bless you abundantly!!
Thanks for another great video. I was asking if there’s a way to get (buy) file handling videos of C programming if I don’t have an android device? I am working on both C and data structures.
Hey neso academy Please bring the html css and java script course please there are lot of videos on youtube platform but your chnanel explanation is very nice so please bring it up
why can't we use group theory permutational group concept ,like as we see in first example we have a permutational group of order 3 thus let our initial link list be r then r^3 is e which is r itself but it's inverse is r^2 as r*r^2 is e thus by two or just one pointer we can solve this problem...
Really good one I have tried to make something deferent by kinda swapping all the linked list one by one its kind of taking the head and put it on the tail and something....
Why dont we first traverse the list in a function and then put address of last node in temp and then second last in temp 2 then put addresses in a reverse order
Super sir.shall you explain with a c++ program which includes single linked list as headerfile.using that headerfile, can we do all the operations of linked list?If it is possible then please explain it sir.Is there any predefined single linked list ADT available in c++.If it is available then please explain it with simple c++ program.Thanking you sir.
Sir please explain this:- We're using "struct node *_____; " so this means ___ will contain data & link too. So whenever we're creating any new pointer why don't we use int. Because if we're using struct node * then everytime it'll create a new node due to struct node data type. Please explain anyone can do so please.
It's not like whenver you write struct node *, it'll also occupy memory of (int + struct node *). by writing only struct node * ptr, it'll create a pointer that can only store the address of Node type data. But if you use struct node *ptr = (struct node *)malloc(sizeof(struct node ) ), then only it'll actually request memeory from heap via malloc function by creating the memory instance of that node data-type.
ease of explaining decreasing with every topic of linked list. in this video i felt uncomfortable with naming temp and temp2 and y u didnt use the names next and prev earlier in the video🥲 sorry for criticising and thank you for the good work🙂
