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

package tree;

/**

• 二叉树的最大深度

• https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof/

• /
  public class MaxDepth {

  /**

  • 递归解法

  • @param root

  • @return

  • /
    public int maxDepth(TreeNode root) {

    if (root == null) {

      return 0;

    }

    int left = maxDepth(root.left);
    int right = maxDepth(root.right);

    return 1 + Math.max(left, right);

    }

    static class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    }
    }