solve in 3 minutes

Author: ngocquanai

104. Maximum Depth of Binary Tree.py

@@ -0,0 +1,13 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def maxDepth(self, root) -> int:
+        if not root:
+            return 0
+        if root.left == None and root.right == None:
+            return 1
+        return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1