This is the reason, you are the knly one i subscribed on YT for DSA. ❤

Bro,A recommendation from my side.Today I searched MINIMUM HEIGHT TREE ON UKposts.I EXCEPTED UR VIDEO TO BE PRESENT THERE BUT THIS VIDEO WAS NOT IN THE LIST.EVEN I SCROLLED TO THE BOTTOM,THIS VIDEO WAS NOT THERE UNDER THE SEARCH OF"MINIMUM HEIGHT TREE".OTHER CHANNEL VIDEO ON THIS PROBLEM SOLN WAS THERE.THEN I SEARCHED "MINIMUM HEIGHT TREE BY ARYAN MITTAL".THEN ALSO THE VIDEO WAS NOT THERE.UR CHANNEL WAS COMING.THEN I WENT INTO UR CHANNEL AND FROM THERE I FOUND OUT THIS VIDEO. SO BASICALLY U DOING SO MUCH HARD WORK AND MAKING QUALITY VIDEOS AND STILL THE VIDEO NOT GETTING MUCH REACH .THE REASON IS THAT THE UKposts IS NOT RECOMMENDING UR VIDEOS OR UKposts ALGORITHM IS NOT PUSHING UR VIDEOS.THEREFORE ,U SHOULD DO SOMETHING TO RESOLVE THIS BCZ UR VIDEOS DESERVE TO GET MORE REACH.

You could simply subscribe to his channel. Also a suggestion, It's harder to read the message with caps lock on. Kindly edit. Thanks 🤙🏻

NO Cpp Better. U need to learn Cpp🙂🙂

@@user-cv6ed5cb9c I am coding in Java since my class 8 so I like Java more haha and there's no difference much it's just preferential

edge case do a simply check in starting if(n==1) return {0};

@@aastikofficial6100 Recently solved by doing some change in my method Here is the code. class Solution { pair t1={0, 0}, t2={0, 0}; pair max_pair(pair &p1, pair &p2){ if(p2.second>=p1.second){ return p2; } else{ return p1; } } pair maxDiam(int node, int prev, vector &adj){ pair max1={0, 0}, max2={0, 0}; for(auto &it: adj[node]){ if(it!=prev){ pair temp=maxDiam(it, node, adj); if(max1.second