考察点：二叉树
public int maxDepth(TreeNode root) { if (root == null) { return 0; } int left = maxDepth(root.left); int right = maxDepth(root.right); int bigger = Math.max(left, right); return bigger + 1; }
考察点：二叉树
public int maxDepth(TreeNode root) { if (root == null) { return 0; } int left = maxDepth(root.left); int right = maxDepth(root.right); int bigger = Math.max(left, right); return bigger + 1; }
名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
