Merge pull request #820 from Mark-777-0/main

Matching Leetcode 102 Answer Style

Author: Ahmad-A0

python/104-Maximum-Depth-of-Binary-Tree.py

@@ -26,11 +26,12 @@ def maxDepth(self, root: TreeNode) -> int:
 # BFS
 class Solution:
     def maxDepth(self, root: TreeNode) -> int:
-        if not root:
-            return 0
+        q = deque()
+        if root:
+            q.append(root)
 
         level = 0
-        q = deque([root])
+        
         while q:
 
             for i in range(len(q)):