本文共 570 字，大约阅读时间需要 1 分钟。

1、题目

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

2、代码实现

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public int maxDepth(TreeNode root) {        if (root == null)             return 0;        return  1 + Math.max(maxDepth(root.left), maxDepth(root.right));    }}

转载地址：https://chenyu.blog.csdn.net/article/details/69663267 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！