Minimum Height Trees | LeetCode 310 | C++, Java, Python

LeetCode Solutions: • LeetCode Solutions | L...
Github Link: github.com/Kno...
*** Best Books For Data Structures & Algorithms for Interviews:*********
1. Cracking the Coding Interview: amzn.to/2WeO3eO
2. Cracking the Coding Interview Paperback: amzn.to/3aSSe3Q
3. Coding Interview Questions - Narasimha Karumanchi: amzn.to/3cYqjkV
4. Data Structures and Algorithms Made Easy - N. Karumanchi: amzn.to/2U8FrDt
5. Data Structures & Algorithms made Easy in Java - N. Karumanchi: amzn.to/2U0qZgY
6. Introduction to Algorithms - CLR - Cormen, Leiserson, Rivest: amzn.to/2Wdp8rZ
*****************************************************************************
Minimum Height Trees | Leetcode 310
Facebook Coding Interview question,
google coding interview question,
leetcode,
Minimum Height Trees,
Minimum Height Trees C++,
Minimum Height Trees Java,
Minimum Height Trees python,
Minimum Height Trees solution,
310. Minimum Height Trees,
#CodingInterview #LeetCode #Google #Amazon #Graph #tree

[@artemilyasov6446]

Great explanation. One note is that your mouse cursor is not visible so when you pointing to something like a node in a tree it is hard to guess what node you are talking about.

[@KnowledgeCenter]

Thanks for letting me know.

[@testshar2117]

@@KnowledgeCenter Seems you just listened and ignored. I found the same thing in your recent largest area rectangle problem too

[@vartikasinghania9723]

great explanation.... I wouldn't have done this without this video..... thank you :)

[@KnowledgeCenter]

Glad it helped!

[@ragingpahadi]

Great explanation !

[@KnowledgeCenter]

Glad you liked it!

[@maheiramkhan]

for(auto &a: adj[node]){
adj[a].erase(node);
if(adj[a].size()==1)
Q.push(a);
}
I have trouble understanding this line, sir. Please help.
for(auto &a: adj[node]) is iterating through the elements of the set at location 'node'. Is that right?

[@KnowledgeCenter]

node is a node in Queue, which we popped. It was a leaf. adj[node] means neighbors(in fact neighbor) of node(leaf). Try without for loop. node should have just 1 neighbor.

[@testshar2117]

10:45 ---- > this, this , this ???? Kahan ho bhai?

[@abhilashpatel6852]

[@palakchawla6396]

Good explanation 👍👍

[@KnowledgeCenter]

Thanks.

[@rizwanghaffar24able]

Great explanation

[@KnowledgeCenter]

Glad you think so!

[@NikhilAsawadekar]

Your cursor is not visible in 90% cases. Too tough to figure out what's going on.

[@sahilchoudhary1473]

great sir

[@KnowledgeCenter]

Thanks.

[@algorithmimplementer415]

I am a bit distracted by the background noise of the video. Seems like baby is crying, or hounds. Pretty spooky.

[@mazharuddin3647]

confusing pointer
, ruined the explanation

[@saharamanson1970]

Where is Prim's??