@@ -0,0 +1,713 @@
+// https://leetcode.com/problems/maximum-depth-of-binary-tree/%0A// Given a binary tree, find its maximum depth.%0A// The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.%0A//%0A//%0A//%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)%0A            return 0;%0A        else if(root.left == null && root.right == null)%0A            return 1;%0A        else %0A            return Math.max(this.maxDepth(root.left), this.maxDepth(root.right)) + 1;%0A    %7D%0A%7D%0A

Create 104._Maximum_Depth_of_Binary_Tree.java