Hey shraddha , I just completed this compelte series on java and it was the most amazing thing i had ever learnt. I request you to plz continue this series and also bring lectures on advance java topics. I really love the way you teach and your relly INSPIRING. THANKYOU for the effort your taking to tech us.
Isme ye nhi samjh aa rha, sumofnode and countof node dono me ham specify to kiye nhi ki node ko count karna h ya node ki value ko, to apne aap kaise return kar rha h sahi value
You are directly working on efficient techniques. For beginners it’s not easy to understand. Write code for naive approach and then teach efficient method.
No doubt Shraddha didi has a decent way of teaching which is very rare nowadays. She makes it easy for the student to adopt the concepts and most importantly, my brain doesn't ache after this rather I get interested to practice more of it.
Hey Ma’am, Your content is on a level far beyond anyone! I want to put a little request: If you could please make a 1.5 hour long video on stack and queues with all the important concepts and questions(easy, medium and hard) including in it and also cover interview oriented questions(kinda crash course type).
Mam can you do a series on aptitude ,logical reasoning ,verbal ability like that you done c++ complete placement course because so much companies are now needed these topics for placement like tcs nqt ... So much work questions under each video as pdf.Its a very helpful all including college students... Then the placement package is also be a complete one ..
In diameter ques diam3=height(root.left)+height(root.right); bcoz we are counting edges in this ques and height basically gives us no. of nodes so we don't need to add 1 to it.
𝗛𝗘𝗜𝗚𝗛𝗧 𝗢𝗙 𝗔 𝗡𝗢𝗗𝗘: The height of a node is the number of edges on the longest path from the node to a leaf. For a node n: 𝗵𝗲𝗶𝗴𝗵𝘁(𝗻) = 𝟭 + 𝗺𝗮𝘅(𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗹𝗲𝗳𝘁),𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗿𝗶𝗴𝗵𝘁)) 𝗗𝗜𝗔𝗠𝗘𝗧𝗘𝗥 𝗢𝗙 𝗔 𝗡𝗢𝗗𝗘: The diameter at a node is the sum of the heights of its left and right subtrees: 𝗱𝗶𝗮𝗺𝗲𝘁𝗲𝗿 𝗮𝘁 𝗻𝗼𝗱𝗲=𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗹𝗲𝗳𝘁)+𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗿𝗶𝗴𝗵𝘁)
Mam, this java + DSA playlist is amazing. It helped me a lot. Thanks a lot. Ma'am I request you to post videos on java + DSA as fast as possible. These are really helpful.
try to cover all topics don't miss anyone because he is very complicated topics and discuss the interview questions for tree ... little bit competitive programing questions
I know/think you have a reason to not upload any lectures video, but you have understand that many learners are connected to this course and depend on this because they are used to your teaching techniques and now they are helpless. At least you tell us time or reason so that we can move on and save us precious time. Thanks for teaching us.
Ma'am I'm big fan of you . I'm from Balochistan, Pakistan . I'm BS English student but now I'm learning coding and programming so your lecture very helpful to me .
Mam your teaching skill is fabulous... The way you teached us... It's really Appreciatable... Your hard works... Your skill... Your consistency.. Your taughts all are fabulous.. Really really big fan of yours..may God bless you shruddha mam....
I am very lucky to get this video, really helpful it makes me able to understand how to use recursion and queue and think about tree questions. Thanks Shraddha Di. Keep it up with different content . Best wishes from my side
You should make 3 hours vedio for each topic and it's all imp interview questions. For example binary tree and all its 20 important interview questions with solutions explained
Plzz teach us how to take input in different ways like the driver code instead of just using direct values. It will be helpful for us for full function problems. Btw I really liked it. Everything's clear. 💥💯
Di I watched this video and it cleared all my doubts regarding trees thank you so much. I have one request can you solve more problems on binary trees asked in amazon, google, microsoft and other product companies please it will be really helpful. Also other traversals as well like zig zag traversal 😊😊😊😊
Thank you mam very much for this course...... Please mam complete this couse for competitive coding also🙏🙏🙏as u did in c++ course.... Its a humble request to complete it as soon as possible mam please 😭🙏
mere college me just trees start hua and mai pahle ki video dekhi thi aapki and trees soch hi raha tha kaha se karu and lo aapki video aa gai .. thankuuu
Shraddha didi and aman bhaiya i love both of u u guys are doin amazing work but it's my humble request to complete this playlist I am waiting from last 1.5 months u guys are bringing new tutorials of new languages (they are also amazing) but u have forgot bout this playlist so plz complete it as soon as possible 🙏🖤 BTW u guys are amazing lots of love 🖤
Hello didi..your videos are really amazing. I am learning better from ur teachings... Than my university...I have a small request as soon as possible will u pls upload ADSA videos also..!! It will be very helpful for us
Hi Shraddha, I've a question here regarding 'count nodes' problem. Counting number of nodes using recursion and level order (using queue) both runs in O(n) time but then why in actual level order takes less time then recursion when submitting the problem be it leetcode, codechef or any other coding platform? For eg - Tree -> [1,2,3,4,5,6] Time with Recursion - 28 ms and time with level order - 16 ms
In general, DFS is faster than BFS. This is because DFS only needs to keep track of the path from the root node to the current node, while BFS needs to keep track of all the nodes that have been visited. This difference in memory usage can be significant for large trees
waiting for the continuation of the course, please upload vedios of BST,AVL,RED BLACK TREES,GRAPHS,.. I REQUEST TO START A COURSE ON DESIGN ANALYSIS AND ALGORITHMS (DAA)..
Hi Shraddha, I have a doubt here. In IsIdentical part at 1:17:51, if subRoot is on leaf but root is not on leaf then also it should be a part of the tree right. Say rootNodes array in preorder sequence is { 1, 2, 4, 6, -1, -1, 7, -1, -1, 5, -1, -1 3, -1, -1} and subNodes array is {2, 4, -1, -1, 5, -1, -1}. In that case also subNode tree is valid. But with this if(root == null || subroot == null) return false; would eliminate this case right? Can you please explain this? It would be very helpful.
Ma'am I request you to post videos on java + DS as fast as possible. These are really helpful.
You are absolutely right
@@harshalbadgujar944 bro playlist are incomplete.
Yes mam same request
Maam please make video on graph
Two pointer and sliding window just u did in C++ course that is really helpful
Aap fast kar ke dekh lo
Hey shraddha , I just completed this compelte series on java and it was the most amazing thing i had ever learnt.
I request you to plz continue this series and also bring lectures on advance java topics. I really love the way you teach and your relly INSPIRING.
THANKYOU for the effort your taking to tech us.
Isme ye nhi samjh aa rha, sumofnode and countof node dono me ham specify to kiye nhi ki node ko count karna h ya node ki value ko, to apne aap kaise return kar rha h sahi value
@@shivamvishwakarma7864 count wale me last me 1 se increment kiye hai aur sum wale me root.data se kiye hai
yahi se differentiate ho reha hai
I thought this channel only became a guidance and motivation channel. Glad to see a teaching content after so long.
Beautifully explained and was really easy to understand for someone from non coding background 🎉
U r so brilliant dhidhi
Ur style is different
I am learning all dsa from ur java course
Now iam in binary
Amazing content ma'am ☺️ lots of respect to you guys and especially Shraddha didi for such an awesome teaching skills
mam ur videos are to the point and directly just absorbed to head...pls post videos on this java dsa regularly mam...it is veryyy useful
The only platform i have learnt in the simplest way.
Thank you ma'am
Please complete this series as soon as possible please .we really need it .
For easy learning of searching algorithm...do watch
ruclips.net/video/qioO9aiozjk/видео.html
You are directly working on efficient techniques. For beginners it’s not easy to understand.
Write code for naive approach and then teach efficient method.
No doubt Shraddha didi has a decent way of teaching which is very rare nowadays. She makes it easy for the student to adopt the concepts and most importantly, my brain doesn't ache after this rather I get interested to practice more of it.
Mam, this java + DS playlist is amazing. It helped me a lot.
I request you to complete this playlist as soon as possible. It will be very helpful.
is it completed ??
Is it?
@@ritamdas_ju😂🎉
Hey Ma’am, Your content is on a level far beyond anyone!
I want to put a little request:
If you could please make a 1.5 hour long video on stack and queues with all the important concepts and questions(easy, medium and hard) including in it and also cover interview oriented questions(kinda crash course type).
Much required
+1, A single video which can help in revising the concepts, Much Required !
@@Cool96267 agreed much needed
True...stacks nd queue...
+++100
tbh it was the best ever video apna college made Trees respect++
Mam can you do a series on aptitude ,logical reasoning ,verbal ability like that you done c++ complete placement course because so much companies are now needed these topics
for placement like tcs nqt ...
So much work questions under each video as pdf.Its a very helpful all including college students... Then the placement package is also be a complete one ..
In diameter ques diam3=height(root.left)+height(root.right); bcoz we are counting edges in this ques and height basically gives us no. of nodes so we don't need to add 1 to it.
𝗛𝗘𝗜𝗚𝗛𝗧 𝗢𝗙 𝗔 𝗡𝗢𝗗𝗘: The height of a node is the number of edges on the longest path from the node to a leaf. For a node n: 𝗵𝗲𝗶𝗴𝗵𝘁(𝗻) = 𝟭 + 𝗺𝗮𝘅(𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗹𝗲𝗳𝘁),𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗿𝗶𝗴𝗵𝘁))
𝗗𝗜𝗔𝗠𝗘𝗧𝗘𝗥 𝗢𝗙 𝗔 𝗡𝗢𝗗𝗘: The diameter at a node is the sum of the heights of its left and right subtrees: 𝗱𝗶𝗮𝗺𝗲𝘁𝗲𝗿 𝗮𝘁 𝗻𝗼𝗱𝗲=𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗹𝗲𝗳𝘁)+𝗵𝗲𝗶𝗴𝗵𝘁(𝗻.𝗿𝗶𝗴𝗵𝘁)
Her level of explanation is outstanding ❤️🌼
Plzzz, upload next part ASAP. The whole playlist was very helpful. Thanks
This is the best video related to tree(DSA) I have ever came across., Thank you ma'am for this. Lost of love. Increament++;
Complete the java course asap!! Really helpful and easily understandable
everywhere we consider root of binary tree as level 0 but here,why is she considering it as level 1,the concept is wrong ?
@@harshsulakhe2720 pehle vid dheka kro fir gyan dia kro
I have never seen a better explainer
Mam, this java + DSA playlist is amazing. It helped me a lot. Thanks a lot. Ma'am I request you to post videos on java + DSA as fast as possible. These are really helpful.
try to cover all topics don't miss anyone because he is very complicated topics and discuss the interview questions for tree ...
little bit competitive programing questions
What are you saying
I know/think you have a reason to not upload any lectures video, but you have understand that many learners are connected to this course and depend on this because they are used to your teaching techniques and now they are helpless. At least you tell us time or reason so that we can move on and save us precious time. Thanks for teaching us.
Ma'am I'm big fan of you .
I'm from Balochistan, Pakistan .
I'm BS English student but now I'm learning coding and programming so your lecture very helpful to me .
❤️ from India
Good explanation with code
I am very happy 😊😁
Thank you very much
Ma'am awesome video .Really helped me understand the topic deeply in class 12th.
Mam your teaching skill is fabulous... The way you teached us... It's really Appreciatable... Your hard works... Your skill... Your consistency.. Your taughts all are fabulous.. Really really big fan of yours..may God bless you shruddha mam....
I am very lucky to get this video, really helpful it makes me able to understand how to use recursion and queue and think about tree questions. Thanks Shraddha Di. Keep it up with different content . Best wishes from my side
You should make 3 hours vedio for each topic and it's all imp interview questions. For example binary tree and all its 20 important interview questions with solutions explained
True
zndgi m pehli baar tree smjh aaya hai thanks for this lecture
😂
Plzz teach us how to take input in different ways like the driver code instead of just using direct values. It will be helpful for us for full function problems. Btw I really liked it. Everything's clear. 💥💯
Please keep uploading videos regularly and finish this playlist fast
Really mam your teaching way👌 maja aa gya bhut acha explaine lete ho
DSA bhut easy way samjhate ha mam ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️
you have missed if(idx
Please update course on regular basis,
It is very helpful
I was waiting this video many time 🥰🥰
Aap Explain bahut acche se karti hai
Di I watched this video and it cleared all my doubts regarding trees thank you so much. I have one request can you solve more problems on binary trees asked in amazon, google, microsoft and other product companies please it will be really helpful. Also other traversals as well like zig zag traversal 😊😊😊😊
Shradha Di for You:"Ye kitni Awesome h Yar"
Please complete this awesome series. Some videos on Hashmap, graph and DYnamic programming etc whenever you get time if possible as soon as possible
U teach very well in a very easy to understandable way👏👏👏👏
Another level of explanation 💯✅
Waooo thank you so much, mai avi avi apka ye trees ka video dhund raha tha😍
I like the way of your explaining di.. chutaku sa task 😄
Thank you mam very much for this course...... Please mam complete this couse for competitive coding also🙏🙏🙏as u did in c++ course.... Its a humble request to complete it as soon as possible mam please 😭🙏
Hello Mam, my study is paused. Please post the next lesson. Thanks a lot for your efforts and god bless you for all the happiness
Thanks for the lecture!! was able to solve the homework question.
These content is so valuable. Please upload more videos on DS + JAVA.
Every problem can be viewed as pre post or inorder traversal. Count of nodes, sum of nodes, height of tree, diameter = post order,
This is a part of graph theory... It is a important course in Mathematics
Thanks for continuing this series...
Thank you so much ma'am very helpful video 😊
Outstanding diii.. Upload more DSA Video Tutorial.. Please🙏🙏🙏
mere college me just trees start hua and mai pahle ki video dekhi thi aapki and trees soch hi raha tha kaha se karu and lo aapki video aa gai .. thankuuu
Shraddha didi and aman bhaiya i love both of u u guys are doin amazing work but it's my humble request to complete this playlist I am waiting from last 1.5 months u guys are bringing new tutorials of new languages (they are also amazing) but u have forgot bout this playlist so plz complete it as soon as possible 🙏🖤
BTW u guys are amazing lots of love 🖤
While watching this video I kept remembering the DOM being a developer I work with it almost daily and yo boiii it's actually a tree 👍🏼
I love your teaching ma'am
Great Teaching seems like more than 10 years experience but 2020 pass out incredible
For easy learning of searching algorithm...do watch
ruclips.net/video/qioO9aiozjk/видео.html
Mai bhi soch rha tha bhi vedio didi jald se jald banayen 🍟💕💕💕💕
Accha hua didi English nhi padhati
@@it_is_Anifinity hGggfZbvefHhyre0s0q
😂😂😂
18:15 if you are creating a static method inside Tree class e.g buildTree(). Then it is not necessary to create an object in Main method.
We cannot make objects for static classes??
Very helpful video & Thank you sradha didi ❤!!!!!!!!!!!!!!!!
Thank you mam, from the bottom of my Heart.
Very helpful video ! Thanks Shraddha ma'am !
I requested you Guys is courses pr bhi thoda sa focus kiya jayee....because a lot of students focusing on java as well.
Thankyou for posting the next video but please try to complete the series as fast as possible we are waiting for the next video.
Didi please continue this JAVA course.........❤️ From JU, Kolkata
Didi plz complete the full stack web development course, it had been stopped at React js from so many days
Hello didi..your videos are really amazing. I am learning better from ur teachings... Than my university...I have a small request as soon as possible will u pls upload ADSA videos also..!! It will be very helpful for us
Great work, keep it up gal :)
But you have missed few corner cases, tell me if you want to know.
Watching you isn't boring!😄
Please upload videos daily and please solve more problems and mention questions 🙏🏻
For easy learning of searching algorithm...do watch
ruclips.net/video/qioO9aiozjk/видео.html
Mam aap bhut great ho.....👍👍👍👌👌
Hi, Thanks it's very useful. Please make in English too if possible.
Your all videos are so helpful for us
1 short videos are too much best way to learn smartly and effectively, hope to get one 🕐 on all main dsa topics
I saw various courses of yours
It's amazing, but non of them seems complete. 🥺
I request you to upload the video on java + DS as fast as possible. Really helpful and easily understandable
For easy learning of searching algorithm...do watch
ruclips.net/video/qioO9aiozjk/видео.html
Love the way you teach.....
Mam please add the further videos(Dynamic Programming) on this playlist . This playlist is very helpful for us .
Pls complete this series 🔥❣️❣️❣️
Perfect teaching thank you for guide in hindi especially
Teaching style is good ✨🙏
please finish it fastly i'm very excited!
Great explanation ...🪄
Thank you didi very helpful video God bless you keep it up,
YA pls complete this as early as possible plssss.....🥺
Mam Plz continue DSA SERIES.
very informative, thankyou Shraddha
Maam ,
At 1:00:33 ,for left subtree you said that height was 2 how it came as it returns value 3
The one woman that every student respects from the very bottom of their hearts !!!
Hi Shraddha, I've a question here regarding 'count nodes' problem. Counting number of nodes using recursion and level order (using queue) both runs in O(n) time but then why in actual level order takes less time then recursion when submitting the problem be it leetcode, codechef or any other coding platform?
For eg - Tree -> [1,2,3,4,5,6]
Time with Recursion - 28 ms and time with level order - 16 ms
In general, DFS is faster than BFS. This is because DFS only needs to keep track of the path from the root node to the current node, while BFS needs to keep track of all the nodes that have been visited. This difference in memory usage can be significant for large trees
Thanks didi aapne teachers se bhi accha samjhya
Thank you so much mam for your precious videos that really help me a lot.....Ma"am could you please make a graph DS video??
waiting for the continuation of the course, please upload vedios of BST,AVL,RED BLACK TREES,GRAPHS,..
I REQUEST TO START A COURSE ON DESIGN ANALYSIS AND ALGORITHMS (DAA)..
Hi Shraddha,
I have a doubt here. In IsIdentical part at 1:17:51, if subRoot is on leaf but root is not on leaf then also it should be a part of the tree right.
Say rootNodes array in preorder sequence is { 1, 2, 4, 6, -1, -1, 7, -1, -1, 5, -1, -1 3, -1, -1} and subNodes array is {2, 4, -1, -1, 5, -1, -1}. In that case also subNode tree is valid.
But with this if(root == null || subroot == null) return false; would eliminate this case right?
Can you please explain this? It would be very helpful.
nhi bhao degi bhai, tu gentz hain na
@@archishmangupta2787 🤣🤣
nice question dude, i want reason too, even leetcode don't have those kind of test cases
Ma,am your class is amazing
Mam video continue kre...I request u🙏🙏🙏🙏🙏
Didi you are my inspiration😁