脚本宝典收集整理的这篇文章主要介绍了104. Maximum Depth of Binary Tree，脚本宝典觉得挺不错的，现在分享给大家，也给大家做个参考。
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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its depth = 3.
难度：easy
题目：给定二叉树，找出最大深度。
最大深度指的是最长路径从根结点到最远的叶子结点。
思路：后序遍历
Runtime: 0 ms, faster than 100.00% of Java online submissions for Maximum Depth of Binary Tree.
Memory Usage: 27.8 MB, less than 73.06% of Java online submissions for Maximum Depth of Binary Tree.
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
if (null == root) {
return 0;
}
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}
}以上是脚本宝典为你收集整理的104. Maximum Depth of Binary Tree全部内容，希望文章能够帮你解决104. Maximum Depth of Binary Tree所遇到的问题。
本图文内容来源于网友网络收集整理提供，作为学习参考使用，版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ：384754419，请注明来意。