@@ -0,0 +1,480 @@
+/**%0A * Problem: https://leetcode.com/problems/maximum-depth-of-binary-tree/%0A * Solution: Find the Height of Binary Tree.%0A * %0A * %0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public int maxDepth(TreeNode root) %7B%0A        if(root == null) return 0;%0A        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));%0A    %7D%0A%7D%0A

Create Maximum_Depth_of_Binary_Tree.java