Chapter 07 section 01 C++ code updated. Java codes added.

Author: liuyubobobo

07-Binary-Tree-and-Recursion/Course Code (C++)/01-Maximum-Depth-of-Binary-Tree/main.cpp

@@ -2,6 +2,11 @@
 
 using namespace std;
 
+// 104. Maximum Depth of Binary Tree
+// https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
+// 时间复杂度: O(n), n是树中的节点个数
+// 空间复杂度: O(h), h是树的高度
+
 /// Definition for a binary tree node.
 struct TreeNode {
     int val;
@@ -14,10 +19,10 @@ class Solution {
 public:
     int maxDepth(TreeNode* root) {
 
-        if( root == NULL )
+        if(root == NULL)
             return 0;
 
-        return 1 + max( maxDepth(root->left) , maxDepth(root->right) );
+        return 1 + max(maxDepth(root->left), maxDepth(root->right));
     }
 };
 

07-Binary-Tree-and-Recursion/Course Code (Java)/01-Maximum-Depth-of-Binary-Tree/src/Solution.java

@@ -0,0 +1,22 @@
+// 104. Maximum Depth of Binary Tree
+// https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
+// 时间复杂度: O(n), n是树中的节点个数
+// 空间复杂度: O(h), h是树的高度
+class Solution {
+
+    // Definition for a binary tree node.
+    public class TreeNode {
+        int val;
+        TreeNode left;
+        TreeNode right;
+        TreeNode(int x) { val = x; }
+    }
+
+    public int maxDepth(TreeNode root) {
+
+        if(root == null)
+            return 0;
+
+        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
+    }
+}