Minimum Height Trees | Leetcode 310 | Live coding session 🔥🔥🔥 | BFS traversal

[@trevorPhillips284]

couldn't do todays question thanks for the video.

[@CodeWithSunchitDudeja]

Happy to help!

[@darshika8808]

can u plz briefly explain y while doing bfs , last nodes remaining will be the mid ones ?

[@CodeWithSunchitDudeja]

kzbin.info/aero/PLEI-q7w3s9gRa-dGulP1CZfN-2w_uiGAK

[@trevorPhillips284]

why the quality of the video is so low? the maximum quality it can be set to is 360p

[@CodeWithSunchitDudeja]

KZbin takes care of it, wait for an hour or so.. it will be updated.

[@crackthecode1372]

How did u got this degree intuition

[@nicolattu]

Today was tough

[@CodeWithSunchitDudeja]

Tricky

[@santoshvarma996]

can you please tell the time and space complexity

[@CodeWithSunchitDudeja]

TC : O(n), n are the no of edges

[@santoshvarma996]

@@CodeWithSunchitDudeja thank you :)

[@ChiragVithlani]

This problem should be renamed from "Minimum Height Trees" to "Find the root". We can imagine like cutting leaf from all sides equally at same level. What is left is root ( can be two node or one ).