Binary Tree Level Order Traversal (BFS) - Leetcode 102 - Trees (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@vivek2319]

great solution, more readable and easy to understand. Just one correction though. if root is None: return [ ] instead of returning None, because it won't pass third test case wherein expected is [ ]

[@GarouNguyen]

I don't say it, I don't talk that much, I prove it, I'll show you, you're so fucking cool bro

[@GarouNguyen]

4:55 you're so fucking cool bro