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 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
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
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
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 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.✌✌
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
@@OpinionZone-is3ml just came across random youtube suggestion...so i thought lets give a try....but its nothing compared to that of striver's explanation...commenting so that people who come here do not waste time in low level content.... PS:-no negativity, just my suggestion ..thats why comment section exists...study wherever u wish but striver is best as of now....
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
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!
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!"
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
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
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😭😭😭😭
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😃😃
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
@@vivekkumarshiv2972 greedy algorithms are also missing yet important pattern but we can find some websites or other channels for that purpose though ....
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!
yes I was looking at the same thing, can you please correct us if we are wrong Kunal, because the number of leaves should be 5 when we include the top left leaf and that will make property no. 5 false.
You were wrong in property no. 4 and 5 in 4th you missed one leaf node in 5th you said excluding root node that is incorrect check for the below 0 / \ 0 0 \ 0 here no. of leaf nodes is 2 and no. of internal nodes with 2 children is 1 that is root node only so the formula is correct but that point excluding root node is wrong.
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 !
But if you just do this video and try and do intermediate or hard questions of leetcode from tree you can't do. You can't even do some easy questions. Tree is no joke. It's really daunting like recursion. This video gives a base but you can't crack faang with this. You need to practice a lot of questions on DSA plus many more things to crack faang. If you are elite student you can do what Kunal says but for mortals like us , I need to solve many questions to get an intuition about that topic.
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
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 ❤
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
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!
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.
Hey Kunal, I've been following TH-cam tutorials to learn DSA for quite some time now, and after wandering from one TH-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!
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)
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 " .
Broo you are the one....... I have been waiting for a DSA course in TH-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.
Hi @KunalKushwaha, Kindly take up Dynamic Programming and graphs as your way of teaching and the way you approach a problem has been amazing and would need your guidance in the remaining DSA concepts as well. Thanks.
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
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......
41:30 is actually Degenerate (or pathological) BT tho? and SKEWED BT is a type of Degenerate BT when all single child nodes are all left (left skewed) or all right (right skewed). source : gfg
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.... 🙏
Kunal you teach great,but all are curious that how you learned like you tell that you debbuged a lot and practiced, but what were the resources you followed?
DSA + interview preparation playlist: th-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 🙏🙏
2 hours 53 minutes video. No one will do for freely. Your name will be remembered in DSA history.😍😍
Best Teacher I ever seen in my Life @kunal
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.
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
Awesome course dude
Thank You Sir 😊💕
Finally
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
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 😂
😂
😂😅
😂😂😂
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
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
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?
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
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
plss take graphs and dp
Finally, Kunal is back with another video from the course 🎉 thank you Kunal ❤
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?
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
Striver is way more better than u man ..... i saw ur explanation ....its nothing when compared with striver....
So what you are doing here. Go there. Don't spread negativity. Logo ki marji . Unko jaha se padhna he waha se padh lenge.
@@OpinionZone-is3ml just came across random youtube suggestion...so i thought lets give a try....but its nothing compared to that of striver's explanation...commenting so that people who come here do not waste time in low level content....
PS:-no negativity, just my suggestion ..thats why comment section exists...study wherever u wish but striver is best as of now....
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
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
Please continue on DSA with more complex topics as you did at start
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!
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
At around 53:00 , the concept is incorrectly explained. Please do your due diligence.
Thanks Kunal!!!! Please continue with the series now it will really be helpful.
"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!"
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
55:03 why is the last node on the left side not a leaf node?
plz provide videos for topics like graph dp sliding window as well
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
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😭😭😭😭
" siblings or nothing " sounded something dark
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😃😃
I hate AI in coding, just don't recommend me until I ask.
still waiting for your graph video
Noting is above Shri Krishna 6:42 same as you are in DSA for us java lovers.
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
Hello brother, I am waiting for graph video, thank you for your valuable content and contribution to the society❤
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 ....
Hi Kunal, I'm waiting for Dynamic Programming playlist. Can you please complete it.
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!
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
@2:44:13
If only this was true.... 🥲
Eagerly awaiting your videos on dynamic programming & graphs, please make them soon.
53:10 Leaf node must be greater than internal node according to that formula. You have missed the left most leaf node on top.
yes I was looking at the same thing, can you please correct us if we are wrong Kunal, because the number of leaves should be 5 when we include the top left leaf and that will make property no. 5 false.
55:08 aren't there 5 leaf nodes
You were wrong in property no. 4 and 5
in 4th you missed one leaf node
in 5th you said excluding root node that is incorrect check for the below
0
/ \
0 0
\
0
here no. of leaf nodes is 2 and no. of internal nodes with 2 children is 1 that is root node only so the formula is correct but that point excluding root node is wrong.
51:48 Node just left below the root node are not leaf node?....So, leaf count should be 4, or i'm getting wrong?
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 😭
All the concepts are explained in a very beginner friendly way and very elaborative.Great effort sir🙌🙌🙌🙌🙏🙏
When will we get Dynamic Programming. Brother We need you.
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
when explaining property 4 and 5 at 55:00 I think it has 5 leaf nodes can anyone please confirm
But if you just do this video and try and do intermediate or hard questions of leetcode from tree you can't do. You can't even do some easy questions. Tree is no joke. It's really daunting like recursion. This video gives a base but you can't crack faang with this. You need to practice a lot of questions on DSA plus many more things to crack faang. If you are elite student you can do what Kunal says but for mortals like us , I need to solve many questions to get an intuition about that topic.
I disagree
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
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
Thanks a lot brother we were eagerly waiting for this lecture.
Respect 100+
39:25 Nothing is perfect in life apart from perfect binary tree.
- Kunal Kushwaha
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.
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.
your teaching skills is amazing..pls complete this dsa course which is very important for us.🙏🙏
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!
I think Kunal made a mistake. 53:00 No(leaf Nodes) = 4 and No(int nodes) = 3 then only the formula no(leaf nd) - 1 = no(int nodes is valid
yes right, if leaf nodes are 3 then internal node will 2 (leaf nodes-1)
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.
👉 Resources
- Join Replit: join.replit.com/kunal-kushwaha
- Trees code: replit.com/@KunalsReplit/Trees-1
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
Sir, pls complete the remaining topics in dsa like hashmaps, graphs and so on...
Hey Kunal, I've been following TH-cam tutorials to learn DSA for quite some time now, and after wandering from one TH-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!
Sehar me dhindora pitwa do mama!!!! Utsav hai aaj toh❤❤
Thanks Kunal for this in depth video , I appreciate your efforts thank...
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)
pahle mujhe tree se darr lagta thaaa...
phir maine kunal ki video dekhi ....
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 " .
Broo you are the one....... I have been waiting for a DSA course in TH-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.
Hi @KunalKushwaha,
Kindly take up Dynamic Programming and graphs as your way of teaching and the way you approach a problem has been amazing and would need your guidance in the remaining DSA concepts as well.
Thanks.
It’s better if you do in IntelliJ like before, it’s easy and fast and not time consuming like this replit..
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
Hello kunal , i m learning a lot from your videos , thankyou so me much for your amazing content , please release the new videos faster ...
It was a great video, great explaination, waiting for DP
by next week bola tha, ek mahina ho gaya
@52:45 leaf nodes =4 right not 3??
Here root node is not considered as the internal node. He clearly explained in 55:18
Kunal please make video of graph dsa
Thank u @KunalKushwaha for continuing your playlist.... it's such amazing gem...lots of love ❤️❤️
I was dying to hear these words - DSA bootcamp will be over within 2 month's 🤓
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......
Plz take Graph and DP also.
41:30 is actually Degenerate (or pathological) BT tho? and SKEWED BT is a type of Degenerate BT when all single child nodes are all left (left skewed) or all right (right skewed).
source : gfg
Bro just Complete this playlist I can't wait more!! Please 🙏
You are looking totally exhausted
Take care of yourself.
Please complete the series asap please
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 am so grateful for what you are doing.........Keep it up
bhaiya how to download notes from git hub
it always show error
"nothing is perfect in life except the perfect binary tree" said by kunal kushwaha aka the DSA saint
I have learnt Linked list from scratch because of you only.Please do the interview questions in trees like the same manner,when will it come?
Kunal you teach great,but all are curious that how you learned like you tell that you debbuged a lot and practiced, but what were the resources you followed?
51:44 -> internal node = 4 and leaf node =3
Kunal you are awesome. The explanation you provide , no one i have seen given explanation like you.
When will the 60 days bootcamp start