Added the solution of Maximum Depth of Binary Tree (#119)

* Binary Tree Inorder Traversal with recursion

* Update README.md

* Binary Tree Inorder Traversal with recursion

* Update README.md

added maximum depth

* Update README.md

Author: MercerFrey

Python/binary-tree-inorder-traversal.py

@@ -1,3 +1,8 @@
+#Time Complexity:   O(n)
+#Space Complexity:  O(n)
+#Speed: 78.92%
+#Memory: 99.97%
+
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, val=0, left=None, right=None):

Python/maximum-depth-of-binary-tree.py

@@ -0,0 +1,17 @@
+#Time Complexity:   O(n)
+#Space Complexity:  O(n)
+#Speed: 98.14%
+#Memory: 50.93%
+
+# 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: TreeNode) -> int:
+        if root is None:
+            return 0
+        else:
+            return max(self.maxDepth(root.left)+1, self.maxDepth(root.right)+1)

README.md

@@ -295,7 +295,8 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 
 | #    | Title                                                               | Solution                          | Time        | Space       | Difficulty | Tag | Note |
 | ---- | ------------------------------------------------------------------- | --------------------------------- | ----------- | ----------- | ---------- | --- | ---- |
-| 1463 | [Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/) | [C++](./C++/Cherry-Pickup-II.cpp) | _O(n \* m)_ | _O(n \* m)_ | Hard       | DFS |      |
+| 1463 | [Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/) | [C++](./C++/Cherry-Pickup-II.cpp) | _O(n \* m)_ | _O(n \* m)_ | Hard       | DFS |      | 
+| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [python](./Python/maximum-depth-of-binary-tree.py) | _O(n)_ | _O(n)_ | Easy       | DFS |      | 
 
 <br/>
 <div align="right">