Solve : Maximum Depth of Binary Tree - BFS

Author: printjin-gmailcom

maximum-depth-of-binary-tree/printjin-gmailcom.py

@@ -0,0 +1,20 @@
+from collections import deque
+
+class Solution:
+    def maxDepth(self, root):
+        if not root:
+            return 0
+
+        queue = deque([root])
+        depth = 0
+
+        while queue:
+            for _ in range(len(queue)):
+                node = queue.popleft()
+                if node.left:
+                    queue.append(node.left)
+                if node.right:
+                    queue.append(node.right)
+            depth += 1
+
+        return depth