LeetCode 102. Binary Tree Level Order Traversal - Interview Prep Ep 70

[@yxs7]

谢谢Fisher! 非常有帮助!

[@FisherCoder]

Many thanks!

[@annawilson3824]

Walking thru the logic, then implementing it. Awesome! If you could relate code details to logic again, say where the level should be vs the inner loop and where we need to pop vs the inner loop, that would be beyond great! Subscribed!

[@sophia0282]

Hi Fisher, can you please let me know why did you use Linkedlist here : Queue queue = new LinkedList(); , while ArrayList were used in other 2 places?

[@wengeance8962]

Thanks, perfect explanation. subscribed!

[@FisherCoder]

Awesome, thank you! :)

[@x841010ify]

Very clear explanation, thanks for all these tutorials, subscribed!!!

[@FisherCoder]

Awesome, thank you!

[@undergradalgo2248]

Dont stop making more videos.

[@alikhansharapat9933]

Your explanation is very good and I think you have unfairly small number of subscribers and view

[@FisherCoder]

I appreciate that!

[@evawang953]

very good explanation!Thanks

[@FisherCoder]

Glad it was helpful!

[@suganyakoodal5447]

You are awesome..Your videos are helping me a lot!

[@FisherCoder]

Happy to hear that!

[@igaming_]

Subscribed

[@sanchitjain9745]

Great Explanation..loved it.. :)

[@FisherCoder]

Thanks a lot 😊

[@sandeshrana7225]

Great

[@yitingg7942]

fisher, 我想请问一下为什么Queue q = new LinkedList(); 这个queue 必须是Linkedlist 而我用arraylist 就不行呢？

[@vickunwu]

因为LinedList实现了Queue接口；ArrayList则没有。
建议下载一个API文档

[@miziwang7023]

我总觉得这个小哥在说“我……我……我”,哈哈哈哈

[@scm534]

this is not a good example because every level has the same number of nodes