CodingProgrammer
diff --git a/‎104_Maximum_Depth_of_Binary_Tree.py‎ ‎104_Maximum_Depth_of_Binary_Tree.py~HEAD‎104_Maximum_Depth_of_Binary_Tree.py renamed to 104_Maximum_Depth_of_Binary_Tree.py~HEAD b/‎104_Maximum_Depth_of_Binary_Tree.py‎ ‎104_Maximum_Depth_of_Binary_Tree.py~HEAD‎104_Maximum_Depth_of_Binary_Tree.py renamed to 104_Maximum_Depth_of_Binary_Tree.py~HEAD
diff --git a/‎104_Maximum_Depth_of_Binary_Tree.py~HEAD_0‎
Lines changed: 18 additions & 0 deletions b/‎104_Maximum_Depth_of_Binary_Tree.py~HEAD_0‎
Lines changed: 18 additions & 0 deletions
diff --git a/‎104_Maximum_Depth_of_Binary_Tree.py~Jason‎ b/‎104_Maximum_Depth_of_Binary_Tree.py~Jason‎
diff --git a/‎104_Maximum_Depth_of_Binary_Tree.py~Jason_0‎ b/‎104_Maximum_Depth_of_Binary_Tree.py~Jason_0‎
@@ -0,0 +1,18 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def maxDepth(self, root):
+        """
+        :type root: TreeNode
+        :rtype: int
+        """
+        if None == root:
+            return 0
+        depth_left = self.maxDepth(root.left)
+        depth_right = self.maxDepth(root.right)
+        return(max(depth_left + 1, depth_right + 1))