@@ -1 +1,1066 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode() %7B%7D%0A *     TreeNode(int val) %7B this.val = val; %7D%0A *     TreeNode(int val, TreeNode left, TreeNode right) %7B%0A *         this.val = val;%0A *         this.left = left;%0A *         this.right = right;%0A *     %7D%0A * %7D%0A */%0Aclass Solution %7B%0A    public int maxDepth(TreeNode root) %7B%0A        if (null == root) %7B%0A            return 0;%0A        %7D%0A        %0A        Queue%3CTreeNode%3E queue = new LinkedList%3C%3E();%0A        queue.add(root);%0A%0A        int levelNodeNum;%0A        int depth = 0;%0A        while(!queue.isEmpty()) %7B%0A            levelNodeNum = queue.size();%0A            for(int i = 0; i %3C levelNodeNum; i++) %7B%0A                TreeNode node = queue.poll();%0A                if (node.left != null) %7B%0A                    queue.add(node.left);%0A                %7D%0A                if (node.right != null) %7B%0A                    queue.add(node.right);%0A                %7D%0A            %7D%0A            depth++;%0A        %7D%0A        return depth;%0A%0A    %7D%0A%7D
 %0A

Update MaxDepth.java