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
"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!"
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
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
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.✌✌
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!
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😃😃
Broo you are the one....... I have been waiting for a DSA course in RU-vid. 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.
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
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.
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!
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
Hey Kunal, I've been following RU-vid tutorials to learn DSA for quite some time now, and after wandering from one RU-vidr 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!
@@vivekkumarshiv2972 greedy algorithms are also missing yet important pattern but we can find some websites or other channels for that purpose though ....
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. 🙌
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
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 ❤
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!
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.... 🙏
# 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
Thanks for the great video as usual !! Just a small correction In Property 4: Number of internal nodes = 3 Number of leaf nodes = 4 (Missed to add the leaf node of root)
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.
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
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......
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
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.
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
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 !
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
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
Watching this DSA Playlist in 2024 . I have started DSA from this playlist , Before starting i was fearing from DSA , i was thinking that i will be unable to complete DSA as i'm Below Below average student from BCA 😅😅. Also i hated "java" first , but from this playlist along with DSA i get cofidence in JAVA as well . Lastly , I just want to say one thing " Kunal Sir You are GOAT of 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.
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.
Thanks a lot Kunal for making another amazing video. I have been following your DSA bootcamp for about 4 months now and covered almost all of your previous videos. At first, when I saw that you are not actively uploading anymore, I was concerned whether or not I should start with your bootcamp. So, I picked the most non-technical video to watch first, that was the time and space complexity lecture. Then one video turned into the whole of linked list, then recursion, sorting, and slowly I covered all the topics that you have taught so far. Not a month ago I completed your OOPS playlist and now I was worried because I didn't have any more topics left to learn about that I didn't already know, and I had to find another teacher whom I can trust to tell me the right thing for free on youtube. But then I saw your video pop up on my feed, and I watched it as soon as I saw it. Your teaching style is very different from others, which I am sure suits myself as well as a lot of other people. I cannot tell you how excited I am to finally hear you say that you will finish this bootcamp within the next 2 months. Looking forward to learning from you.
@@mysteryman2213 Hey i am in first year. But in our clg they teach dsa with c. Shud I see these lectures or no. Clg dont teach in cpp Or java. Can i follow kunal. For dsa. Will i be able to solve leetcode questions after these lectures
@@Tejaswi-xd4re you should either learn in java or cpp instead of C.. There aren't much solutions in c.. and c is not object oriented too... Let your college teach whatever they do.. you just gotta differ the syntax rest the things are same. My suggestion is if you like these videos continue watching them. And also watch the object oriented videos of kunal. Let's connect somewhere ?
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
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.
in property 4,missed counting 1 leaf node so in property 5 the formula will be No.of leaf nodes=1+No.of internal nodes with 2 children(including root). By the way your videos are amazing and thanks for your effort
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
@@KunalKushwaha wish me luck tomorrow I have my interview and questions will be coming from LL and Trees 😭 I am not worried of the outcome of the interview but extremely happy that I am able to learn such great stuff and I am sure if I continue this learning then no one can stop me!!
@@theanonymous92 not good, was not able to solve the tree question 🥲 but I’ll tell everyone to keep giving interviews and work on what went good or bad, if you keep self improving you’ll make it !
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.❤
