This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.
package class06;
// 测试链接：https://leetcode.com/problems/maximum-depth-of-binary-tree
public class Code04_MaximumDepthOfBinaryTree {
public static class TreeNode {
public int val;
public TreeNode left;
public TreeNode right;
}
// 以root为头的树，最大高度是多少返回！
public static int maxDepth(TreeNode root) {
if (root == null) {
return 0;
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
