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

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) { // write code here if (root == null){ return 0; } int lDepth = maxDepth(root.left); int rDepth = maxDepth(root.right); return 1 + Math.max(lDepth,rDepth); } }