题解 | #二叉树的最大深度#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 * }
 */

public class Solution {
    /**
     *
     * @param root TreeNode类
     * @return int整型
     */
    public int maxDepth (TreeNode root) {
        if (root != null) {
            int LeftDepth = 0;
            int RightDepth = 0;
            if (root.left != null) {
                LeftDepth = maxDepth(root.left);
            }
            if (root.right != null) {
                RightDepth = maxDepth(root.right);
            }
            return Math.max(LeftDepth, RightDepth) + 1;
        }
        return 0;
    }
}