Add files via upload

Author: assassint2017

Maximum Depth of Binary Tree/Maximum_Depth_of_Binary_Tree.cpp

@@ -0,0 +1,27 @@
+// 思路一 二叉树的高度等于 max(depth(左子树), depth(右子树)) + 1 利用递归求解
+// 4ms 98.96%
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    int maxDepth(TreeNode* root) {
+        if (!root)
+            return 0;
+        else if (!root->left && !root->right)
+            return 1;
+        else
+        {
+            int depthLeft = maxDepth(root->left); 
+            int depthRight = maxDepth(root->right);
+            return depthLeft > depthRight ? depthLeft + 1 : depthRight + 1;
+        }
+    }
+};

Maximum Depth of Binary Tree/Maximum_Depth_of_Binary_Tree.py

@@ -0,0 +1,23 @@
+# 思路一 二叉树的高度等于 max(depth(左子树), depth(右子树)) + 1 利用递归求解
+# 72ms 35.60%
+
+# 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 root is None:
+            return 0
+        
+        if root.left is None and root.right is None:
+            return 1
+        
+        return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1