What a mind-blowing explanation.I'm just loving it❤ but it would be so great if you have complete this course. Thank you so much for such amazing content we really appreciate your work 🙏
Thank you again Kunal! I went from being scared of recursion last week to being able to implement a recursive insert node in a BST function BY MYSELF thanks to you!
Thank you, Kunal, for this exceptional playlist. It's the first resource where I've felt truly equipped to master topics without seeking elsewhere-a testament to your comprehensive and empowering teaching approach
"Kunal Kushwaha's teaching style is both engaging and effective, making the learning experience enjoyable for students. The way he explains concepts related to binary tree and binary search trees is clear and concise, fostering a deep understanding of the topic. His commitment to quality education is truly commendable. I appreciate the effort and passion he brings to the teaching process, making it a valuable experience for anyone looking to grasp the intricacies of binary search trees. Keep up the excellent work, Kunal, and thank you for making learning a rewarding journey!"
Hey kunal, needless to say nobody teaches like you in this space and we all are grateful for it. We are eagerly waiting for the next set of videos in this bootcamp so yeah EAGERLY WAITING!! THANKS!!
@@KunalKushwaha Amazing work kunal ! Now please come with dynammic programming and Graph lectures. You will not realize I already done trees my self from other tutors around 4 to 5 months ago and now I am thinking to revise it and guess what .It just take me one day to revise it just because of your video
so some little corrections that i found were : 1. At 53:20 approx in this tree you took 3 leaf node and 4 internal whereas it was opposite 2. if no of leaf nodes are 'n' then the min height has to be log(n) 3. if 'n' nodes in total min possible height = log(n+1)-1 [not log(n+1)
@@workHolic-ne6eo No, root node is not an internal node.Tthe root node is a special case of a node that does not have a parent, and it is not classified as an internal node.
@@BhaweshPandey-u9w The Formula ( no.of leaf nodes = 1 + no.of internal nodes with 2 childs) holds true only if we consider root node as an internal node..... at 55:00 kunal took leaf nodes = 4 but it's actually 5
Thank You Kunal bro was waiting for this as i started dsa 2 months before i was about to complete linkedlist video and was worried where to watch the remaining concepts, thank you somuch again as you continued the course so i could continue my learning. Your DSA videos are the best and easy to understand than my college dsa lectures. and not only that you also shared about the thought process while solving the problems which helped me a lot to solve new problems easily. I already have shared with my college friends about the DSA playlist .Once again Thank You somuch bro🙏🙏🙏🙏. Hoping that i will crack faang companies during placements.✌✌
OMG! The tree video is finally here! Thank you Kunal for providing this amazing content all for free. This course really is the best DSA course I have found on the internet. Oh also, is a hashmap video coming out soon. Thanks!
At 2 hr 45 min, realised how much he wanted to complete this course, yet life gets hectic sometimes, still will keep up looking to you sir and will always remember you as the best DSA teacher
Broo you are the one....... I have been waiting for a DSA course in UA-cam. I have tried many playlists nothing worked for me. Then I decided to take a paid course. But fortunately I found this channel before I paid to course that i can never regret.
Bro your code is very different from the others and it's amazing but it takes lot of time to understand and little bit confusing also. I watched twice to clear my doubts, Thanks for the video😃😃
Hey Kunal, I've been following UA-cam tutorials to learn DSA for quite some time now, and after wandering from one UA-camr to another I had to come back to your videos as the pattern you follow of Theory + Questions is unique in itself and very addictive, since your teaching style is so good. Thanks for the course and keep the videos coming, godspeed to my guy, I know you are gonna make it big, bigger, biggest, so all the best to you for that!
I was going through one of the ques asked in one of the FAANG companies, and while watching this video it cleared my concepts so nicely that I feel confident about the same concept if ever asked to me in any interview
This bootcamp is amazing, I've learned so many new topics in DSA and my logic building have improved so much since I started watching your videos. I am very eager to learn more from these videos, data structures like graphs and new concepts like Dynamic Programming. Waiting for videos on these topics!! Thank you so much Kunal for doing this!
Earlier, I thought trees were a very tough topic in DSA, but you made it easy, bro!! The way you teach to develop intuition is amazing. Hats off to you. 🙌
bro is learning himself and then upload videos, after a year somehow he remembered that he's a course to complete...he can definitely talk the talk but cant walk the walk
2:10:05 I think we don't need to check whether the left subtree or right subtree is balanced or not because we are maintaining the height of every node while insertion , hence those function calls will be redundant ( if it's wrong please correct me 🙂 ) ( I am able to write this because of Kunal's great explanation ) thanks to Kunal ❤
its been a year since you posted this video ,and you have told in the end that in the next 2 months this DSA bootcamp will be finished. Please complete this man.
@@vivekkumarshiv2972 greedy algorithms are also missing yet important pattern but we can find some websites or other channels for that purpose though ....
Bhaiya aap se achha content rarely internet par milta h...... You are gem bhaiya and your explanation level is unbelievable.., plz complete all concept of dsa bhaiya.... 🙏
51:26 there are actually 4 leaf nodes right? the left most node? in that case the formula holds true. leaf nodes = internal nodes + 1 4 (leaf nodes) = 3(internal nodes) + 1; inserting a node 4 - 1 + 2(new leaves) = 3 + 1(old leaf now internal) => 5 = 4 + 1
Your videos are amazing, no one else can teach better than this, approach of theory followed by questions is really good. Please complete the course.......We are waiting for the complete playlist please......
# GOD Of DSA Hi I am a 11yr exp java guy was searching for some free course on youtube for DSA came accross your course and i just feel love in it...all in one place that too with java...i must say you have done very awsome work...your name will be there on this earth as long as DSA will be asked in interviews...May God Vishnu Bless You :)
Iam too a 4th year guy ....his lectures are amazing , being from a tier 3 clg i didn't got enough time to learn , most of the time i writed assignments , records , observations 😢 atleast now i got freedom to learn what ever i want
First video I have seen and I understood clearly the Binary Search Tree. You explained very well the content, and it is very helpful when you debug the code and show the stack for recursion. Thanks Kunal.
Heyy Kunal, first of all thankyou v much for this wonderful course, it helped a lot and by following your tips and clap points I’m doing v well in DSA. I have a request for you, can you please upload videos on graphs, practice questions on trees and graphs and video on DP and question practice on them, it would really help us all. I know you are busy with your other works but can you please upload the videos faster, as I feel that I can understand topics from your videos only and by seeing other youtube videos I don’t get it completely. So it would really help me if you could upload videos by next month. Thankyou v much
Just amazing ❤ Waiting for AVL trees, graphs, and traversals .... and more importantly, The Questions Thanks, #DSAWithKunal, for such a special bootcamp for free !!
Hey I'm freshman at manipal can you tell by what time the playlist will be finished and what're the resources to practice qns once we're done with 1 lecture
Bro I'm enrolled in a PG course, my placements will start in August, please can you upload more videos as soon as it's possible for you, it's a request. Thank you very much for all your efforts and for every single video that exist till now !
Thank yo so much Kunal. I was always scared of Non linear Data Structures and the programs involving them. But you made the concepts very clear and I'm really grateful about it.
I just Finished the video and i just can't tell you in words what you are doing such amazing content like i am able to solve questions by myself well thankyou for everything that you provided thanks alottt kunal
AT 54:24 in properties why the extreme left one is not a leaf node , that one that is just in left of the root node why its not a leaf node and if its a leaf node then the property 5 fill fail
This is by far the best way in to explain Binary tree thanks Man I have true respect and Admiration For Your Work Please DO finish this DSA Bootcamp loved it and has been following it from Day 1 .Thanks Again
In properties section at 51:42 while explaining last two properties why did you not considered the root nodes left node as leaf node, if you consider it as leaf node instead of internal node the proof is simple. can you explain this confusion, i think something is wrong in that proof
After searching lots of video on youtube for tree finally get "THE BEST". I didn't get word to describe my feeling how clearly I am able to understand. Waiting for graph video as well
I don't know why i am losing interest in coding. I need an mentor who is from India who can again build my focus on coding. kunal bhaiya bata do koi ya koi audience mai se hi bata do😭😭😭😭
Kunal can you please make one more tree video where you can like do 6-7 questions on leetcode of trees... and tell us like how to approach them.... just like old time 😅🙏
@@eshansyoutube bro if you are gonna appear for placements, I'll not recommend you to solely depend on him cuz he uploads on dsa video in like 5 months nowdays.
@@zanies6288 Yeah I feel the same...I have done the concepts from other sources but need him to once do the questions on trees and graphs video... Hope he does that🙃
Excited Kunal it took me whole night to complete this video. Now I will solve assignment questions excited for next videos Thank you I appreciate your hard work.
Sir, please complete the playlist or give us update about playlist Sir, I am really worried I have been exploring many other courses, they are good but no one talks about thinking process Sir please complete the playlist, Thank you for starting this course, we really need you sir
your style of teaching is best , with your recursion videos i am able to fully understand the recurssion topic very easily, please try to complete this bootcamp.
Still, the quality & content is so amazing! & the people who is following the course from the beginning will not have any queries regarding the recursion parts of this video. It is already in my mind when you are explaining the thought process.❤
Oh Jesus The way you taught me like I just wasted my 20 days+ to learn DSA and that fucking Big O notation Concept and you just cleared me in 5 min Where is it implemented how it works and you literally fuckin proved it. Man I appreciate you. This is my first video that I'm watching from your channel and you starting clearing my concept from one video. So if I access your remaining video in which level I'm about to be clear. It shows.....Thank you so much sir.
Such a great video for the beginner. Even though I thought the binary tree will be a very difficult topic this is not that for such tutorial. Thanks a lot kunal.
DSA + interview preparation playlist: ua-cam.com/play/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ.html
bhai please dp aur graph bhi padha do
Please finish rest of the topics ASAP ::::(
Thank you Kunal for these best videos 🙏🙏
when will the furthuer DSA topic video will out , like DYnamic programming , Red black Trees , Decision Trees
What a mind-blowing explanation.I'm just loving it❤ but it would be so great if you have complete this course.
Thank you so much for such amazing content we really appreciate your work 🙏
2 hours 53 minutes video. No one will do for freely. Your name will be remembered in DSA history.😍😍
Thank you again Kunal! I went from being scared of recursion last week to being able to implement a recursive insert node in a BST function BY MYSELF thanks to you!
Thank you, Kunal, for this exceptional playlist. It's the first resource where I've felt truly equipped to master topics without seeking elsewhere-a testament to your comprehensive and empowering teaching approach
"Kunal Kushwaha's teaching style is both engaging and effective, making the learning experience enjoyable for students. The way he explains concepts related to binary tree and binary search trees is clear and concise, fostering a deep understanding of the topic. His commitment to quality education is truly commendable. I appreciate the effort and passion he brings to the teaching process, making it a valuable experience for anyone looking to grasp the intricacies of binary search trees. Keep up the excellent work, Kunal, and thank you for making learning a rewarding journey!"
Hey kunal, needless to say nobody teaches like you in this space and we all are grateful for it. We are eagerly waiting for the next set of videos in this bootcamp so yeah EAGERLY WAITING!! THANKS!!
So nice of you
@@KunalKushwaha next video when sir and totally how many videos are left in these masterpiece playlist? thanks for the reply🥰
@@KunalKushwaha Hey Kunal, any update on when are you planning to continue this series ?
@@KunalKushwaha Amazing work kunal ! Now please come with dynammic programming and Graph lectures. You will not realize I already done trees my self from other tutors around 4 to 5 months ago and now I am thinking to revise it and guess what .It just take me one day to revise it just because of your video
Awesome sir . Pls complete the course. You are the best, none like you in teaching dsa!!
what is incomplete in this playlist?
@@atharvayadav6054 hashmaps,priority queues,tries and huffman coding,dp, graphs
@@atharvayadav6054 most of the data structures haven't been covered
Except DP ],Graph and Heaps interview questions I think
everything is cleared @@cameratechnology8870
so some little corrections that i found were :
1. At 53:20 approx in this tree you took 3 leaf node and 4 internal whereas it was opposite
2. if no of leaf nodes are 'n' then the min height has to be log(n)
3. if 'n' nodes in total min possible height = log(n+1)-1 [not log(n+1)
yes sir right
also he said root node is not internal node. which is false
@@workHolic-ne6eo No, root node is not an internal node.Tthe root node is a special case of a node that does not have a parent, and it is not classified as an internal node.
@@BhaweshPandey-u9w The Formula ( no.of leaf nodes = 1 + no.of internal nodes with 2 childs) holds true only if we consider root node as an internal node..... at 55:00 kunal took leaf nodes = 4 but it's actually 5
for pt. 2 and 3 , I think Kunal is considering root node also as a level 1
Thank You Kunal bro was waiting for this as i started dsa 2 months before i was about to complete linkedlist video and was worried where to watch the remaining concepts, thank you somuch again as you continued the course so i could continue my learning. Your DSA videos are the best and easy to understand than my college dsa lectures. and not only that you also shared about the thought process while solving the problems which helped me a lot to solve new problems easily. I already have shared with my college friends about the DSA playlist .Once again Thank You somuch bro🙏🙏🙏🙏. Hoping that i will crack faang companies during placements.✌✌
Hello are u a student?
OMG! The tree video is finally here! Thank you Kunal for providing this amazing content all for free. This course really is the best DSA course I have found on the internet. Oh also, is a hashmap video coming out soon. Thanks!
At 2 hr 45 min, realised how much he wanted to complete this course, yet life gets hectic sometimes, still will keep up looking to you sir and will always remember you as the best DSA teacher
I have already secured a position at one of the FAANG companies, but I always learn something new from Kunal's videos. Thank you, Kunal. 🙏
Congrats!
Where do you work?
@@KrishNamaste He got at amazon but in Python
Thank you Kunal Bhaiya for the amazing DSA Bootcamp:)
What is bootcamp and where is it? Just found this video randomly 🤚🏻
@@tejas58 this playlist
@@tejas58 Tejas pramod?
Kunal, you are exceptionally well. We are really grateful to you for your time and the quality you are providing us. Keep growing :)
So nice of you
Broo you are the one....... I have been waiting for a DSA course in UA-cam. I have tried many playlists nothing worked for me. Then I decided to take a paid course. But fortunately I found this channel before I paid to course that i can never regret.
Finally, Kunal is back with another video from the course 🎉 thank you Kunal ❤
Bro your code is very different from the others and it's amazing but it takes lot of time to understand and little bit confusing also. I watched twice to clear my doubts, Thanks for the video😃😃
Thanks Kunal!!!! Please continue with the series now it will really be helpful.
Please continue on DSA with more complex topics as you did at start
Hey Kunal, I've been following UA-cam tutorials to learn DSA for quite some time now, and after wandering from one UA-camr to another I had to come back to your videos as the pattern you follow of Theory + Questions is unique in itself and very addictive, since your teaching style is so good.
Thanks for the course and keep the videos coming, godspeed to my guy, I know you are gonna make it big, bigger, biggest, so all the best to you for that!
I was going through one of the ques asked in one of the FAANG companies, and while watching this video it cleared my concepts so nicely that I feel confident about the same concept if ever asked to me in any interview
All the concepts are explained in a very beginner friendly way and very elaborative.Great effort sir🙌🙌🙌🙌🙏🙏
Yay, you are back! Thank you so much for being this generous with your time and knowledge!
This bootcamp is amazing, I've learned so many new topics in DSA and my logic building have improved so much since I started watching your videos. I am very eager to learn more from these videos, data structures like graphs and new concepts like Dynamic Programming. Waiting for videos on these topics!! Thank you so much Kunal for doing this!
Earlier, I thought trees were a very tough topic in DSA, but you made it easy, bro!! The way you teach to develop intuition is amazing. Hats off to you. 🙌
bro is learning himself and then upload videos, after a year somehow he remembered that he's a course to complete...he can definitely talk the talk but cant walk the walk
Is the playlist finally completed?
@@lucifer8257 no the playlist is not complete and the frequency at which he posts videos says that this playlist will remain incomplete for years
The best thing he did is he guided is how to learn concepts and think so give him time guys
The BEST playlist for TREES using java👏👏👏
Wow, thanks!
@@KunalKushwaha U made my day super happy with reply bhaiya.
2:10:05 I think we don't need to check whether the left subtree or right subtree is balanced or not because we are maintaining the height of every node while insertion , hence those function calls will be redundant ( if it's wrong please correct me 🙂 ) ( I am able to write this because of Kunal's great explanation ) thanks to Kunal ❤
Yes I was also thinking what is need of checking subtrees when we are finding if tree is balanced or not at root.left and root.right.
its been a year since you posted this video ,and you have told in the end that in the next 2 months this DSA bootcamp will be finished. Please complete this man.
please kunal continue the playlist . this playlist is like a gem🍷
what is incomplete in this playlist?
@@atharvayadav6054 graphs,heap,hashmaps
@@vivekkumarshiv2972 greedy algorithms are also missing yet important pattern but we can find some websites or other channels for that purpose though ....
Sala aisa master nahin dekha mene.. salute to you. Love from Afghanistan.
I like his teaching methods
I started his video and remembered that FOGG ad, in which, when the Oldman (FAANG CEO) smells FOGG on his daughter (FAANG INTERVIEWEE) and says Kunal
underrated
Bhai aap yahan 😂
😂
😂😅
😂😂😂
The more you watch it, more you understand. This is video is a gem.
Bhaiya aap se achha content rarely internet par milta h...... You are gem bhaiya and your explanation level is unbelievable.., plz complete all concept of dsa bhaiya.... 🙏
I have shared this videos to my colleagues also. Thank you for doing this.
51:26 there are actually 4 leaf nodes right? the left most node? in that case the formula holds true.
leaf nodes = internal nodes + 1
4 (leaf nodes) = 3(internal nodes) + 1; inserting a node
4 - 1 + 2(new leaves) = 3 + 1(old leaf now internal) => 5 = 4 + 1
Thank you delivering such content for free! Hats-off to you man. This content is far far better than what was taught in the college.
Your videos are amazing, no one else can teach better than this, approach of theory followed by questions is really good. Please complete the course.......We are waiting for the complete playlist please......
came for revision. now I feel I am levelled up literally. This all seems so easy now. Thanks Kunal❤
Noting is above Shri Krishna 6:42 same as you are in DSA for us java lovers.
# GOD Of DSA
Hi I am a 11yr exp java guy was searching for some free course on youtube for DSA came accross your course and i just feel love in it...all in one place that too with java...i must say you have done very awsome work...your name will be there on this earth as long as DSA will be asked in interviews...May God Vishnu Bless You :)
your teaching skills is amazing..pls complete this dsa course which is very important for us.🙏🙏
You are a genius Kunal. Explaining these topics in simple terms is a class apart. Hats of to your beautiful mind and perseverance.
Thanks a lot brother we were eagerly waiting for this lecture.
Respect 100+
i really fall in love with the way you teaching the topics 😍, its seem like DSA is nothing but a piece of cake .
kunal please complete these series there no one online teaching better than you , am a 4th year student
Iam too a 4th year guy ....his lectures are amazing , being from a tier 3 clg i didn't got enough time to learn , most of the time i writed assignments , records , observations 😢 atleast now i got freedom to learn what ever i want
First video I have seen and I understood clearly the Binary Search Tree. You explained very well the content, and it is very helpful when you debug the code and show the stack for recursion. Thanks Kunal.
Heyy Kunal, first of all thankyou v much for this wonderful course, it helped a lot and by following your tips and clap points I’m doing v well in DSA. I have a request for you, can you please upload videos on graphs, practice questions on trees and graphs and video on DP and question practice on them, it would really help us all. I know you are busy with your other works but can you please upload the videos faster, as I feel that I can understand topics from your videos only and by seeing other youtube videos I don’t get it completely. So it would really help me if you could upload videos by next month. Thankyou v much
Kunal you are awesome. The explanation you provide , no one i have seen given explanation like you.
Just amazing ❤
Waiting for AVL trees, graphs, and traversals .... and more importantly, The Questions
Thanks, #DSAWithKunal, for such a special bootcamp for free !!
Hey I'm freshman at manipal can you tell by what time the playlist will be finished and what're the resources to practice qns once we're done with 1 lecture
@@halftimetalks leave it dsa is hard for your dumb brain
@@halftimetalks go to the description of the video. You'll find assignments there.
Best Teacher I ever seen in my Life @kunal
The goat 🐐 of sarcasm,roasting but most imp teaching hard concepts easily is back 🔥🔥🔥
Edtech companies:We have best DSA course buy it
Kunal(🐐): Wake up to reality
"Thank you so much for this incredible course, sir! Your teaching style makes complex topics easy to understand and truly enjoyable!"
53:00 On the 4th property when expanding on Strict binary tree, Isn't the no.of leaf nodes initially 5, and internal nodes 3
Best part of this bootcamp is that we don't ever need any prerequisite and still master the whole DSA bootcamp if you just follow kunal's path.
Bro I'm enrolled in a PG course, my placements will start in August, please can you upload more videos as soon as it's possible for you, it's a request.
Thank you very much for all your efforts and for every single video that exist till now !
@@himanshumali5889 yeah
Thank yo so much Kunal. I was always scared of Non linear Data Structures and the programs involving them. But you made the concepts very clear and I'm really grateful about it.
amazing course , thank you kunal for your time and no one will do such quality courses for free
We appreciate this efforts from you.
I just Finished the video and i just can't tell you in words what you are doing such amazing content like i am able to solve questions by myself well thankyou for everything that you provided thanks alottt kunal
AT 54:24 in properties why the extreme left one is not a leaf node , that one that is just in left of the root node why its not a leaf node and if its a leaf node then the property 5 fill fail
thanks, bro for all your effort, because of you average student like me can understand DSA and will get placed
No one can make you learn trees better than this lecture!!
Mark my words, he has done an exceptional work.!
So nice of you
@@KunalKushwaha A request ,plz if you can then make videos on dp and graph as early as possible..thank you once again❤️
I have been following this course for some time. Love these, quite on point and easy to understand.
Please bhaiya complete this bootcamp ,
This the best dsa course I have ever watched
So please please please complete this whole dsa series
😊😊😊
bro is dsa not bsa
@hadishanabas he meant bro solving algo I guess.
@@Hadishanavas ,😸
This is by far the best way in to explain Binary tree thanks Man I have true respect and Admiration For Your Work Please DO finish this DSA Bootcamp loved it and has been following it from Day 1 .Thanks Again
Much appreciated!
Sir, pls complete the remaining topics in dsa like hashmaps, graphs and so on...
The Best course to understand and implement Thanks to you kunal now able to do it in ease
In properties section at 51:42 while explaining last two properties why did you not considered the root nodes left node as leaf node, if you consider it as leaf node instead of internal node the proof is simple. can you explain this confusion, i think something is wrong in that proof
Same bro
After searching lots of video on youtube for tree finally get "THE BEST". I didn't get word to describe my feeling how clearly I am able to understand. Waiting for graph video as well
I don't know why i am losing interest in coding. I need an mentor who is from India who can again build my focus on coding. kunal bhaiya bata do koi ya koi audience mai se hi bata do😭😭😭😭
plz upload atleast one video in a week This course is next level. I watch many videos of dsa but this is different
55:03 why is the last node on the left side not a leaf node?
hey kunal ! glad to watch this this video thankeyou so much for your efforts keep it going bro.........
Kunal can you please make one more tree video where you can like do 6-7 questions on leetcode of trees... and tell us like how to approach them.... just like old time 😅🙏
Watch this video, I am answered your question
He said he will make a playlist of trees
@@KunalKushwaha Got the answer🥺👍 just a request please complete the playlist in one month... placements incoming😵
@@eshansyoutube bro if you are gonna appear for placements, I'll not recommend you to solely depend on him cuz he uploads on dsa video in like 5 months nowdays.
@@zanies6288 Yeah I feel the same...I have done the concepts from other sources but need him to once do the questions on trees and graphs video... Hope he does that🙃
I am so grateful for what you are doing.........Keep it up
Hi Kunal, Thanks for the videos. I have a doubt why you didnt consider the left most node at 51:37 as leaf node?
he missed it, there will be 4 leaves and 3 internal nodes(ancestors).
@@iminoaruu then the formula’s he used will give wrong answer
@@rohanbawri2794 it's correct, the formula says leaves = internal nodes + 1 ie. leaves = 3 + 1 = 4.
@@iminoaruu formula in 55:10
@@rohanbawri2794 that's literally what i wrote man 😭
Thankyou for continuing the series. Looking forward to question video 🙏🏽
55:08 aren't there 5 leaf nodes
Excited Kunal it took me whole night to complete this video.
Now I will solve assignment questions
excited for next videos
Thank you I appreciate your hard work.
at 55:11 there are total leaf node are 5 instead of 4 , left node of root is also a leaf node. is am i right?
yeaahh
THE BEST BHAIA EVER I MEET... WHO IS BEHAVE LIKE OWN BROTHER..
plss take graphs and dp
Sir, please complete the playlist or give us update about playlist
Sir, I am really worried
I have been exploring many other courses, they are good but no one talks about thinking process
Sir please complete the playlist, Thank you for starting this course, we really need you sir
your style of teaching is best , with your recursion videos i am able to fully understand the recurssion topic very easily, please try to complete this bootcamp.
👉 Resources
- Join Replit: join.replit.com/kunal-kushwaha
- Trees code: replit.com/@KunalsReplit/Trees-1
Kunal , you have created an amazing playlist. This playlist is the best playlist ever. Please provide vedios on dp, graphs as well.
I find it easy to connect and learn from him that I have forgotten that other teachers exist too 🤩
This guy has a really good Knowledge and he shares it in a very well way 👍👍
Thank you so much for your hard work and dedication for providing this course Kunal....Its mean a lot for me👍✌
I've embarked on my DSA journey for a better future! 🤓💪 No one explains this stuff for free! 🙌 #DSA #OpenSource #LearningJourney
Still, the quality & content is so amazing!
& the people who is following the course from the beginning will not have any queries regarding the recursion parts of this video. It is already in my mind when you are explaining the thought process.❤
This is a best bootcamp for DSA available! Please complete the playlist ASAP.
Thank you kunal for resuming DSA lectures. You made DSA easy and interesting with use cases
FInally FInally FInally !! Legend is Back !! Thank you bhai
Oh Jesus The way you taught me like I just wasted my 20 days+ to learn DSA and that fucking Big O notation Concept and you just cleared me in 5 min Where is it implemented how it works and you literally fuckin proved it. Man I appreciate you. This is my first video that I'm watching from your channel and you starting clearing my concept from one video. So if I access your remaining video in which level I'm about to be clear. It shows.....Thank you so much sir.
god of dsa kunal please complete this bootcamp first we are waiting for new videos
the complexity section, in the beginning, is more than enough to binge-watch your videos. out of the world. no one does it like the way you do it.
Hello
Are u a student Or working?
@@manishapalsam1304 Hi, I am a student.
Ok
U are learning dsa?
Such a great video for the beginner. Even though I thought the binary tree will be a very difficult topic this is not that for such tutorial. Thanks a lot kunal.
Life changing, best course out there