Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL
sir your video are literally worth enough ..!!apart from this your knowledge your gesture your way of explanations set the platform to different level..!! hands up to u sir👏👏
Sir, Please upload All sorting programs Sir, I am a great fan of yours teaching. I studied C from you in Ameerpet and studying data structure from youtube... Please...Uploading all sorting programs.ASAP as it great time for us in Bangalore to get a job.
very nice explanation could you please post reverse double linked list and tress like BST,AVL tress operations,hashing also iam looking for your posts please post ASAP
Respected Sir I have understood very well but having problem in printing the reverse linked list how to print it can you please explain in text or any other way I'll be very thankful to you
We r taking the p pointer to pointer to next node..and q pointer to point to the previous node (u can see q node in inner while loop)..i mean in order to swap all elements of linkes list we have to make the p pointer to point to next node and q pointer point to previous node... Hope u got clarify man. Happy coding😉
this is a BAD implementation to reverse single linked list! Because there is a great overhead when swapping the data of 2 nodes, and the time complexity is O(n^2) because you have to access linked list each time when going to the position j ! Besides, you can Google for a best solution, maybe it's about O(n) time and just swap the pointer but not the data!