LeetCode 104. Maximum Depth of Binary Tree
Posted flowingfog
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 104. Maximum Depth of Binary Tree相关的知识,希望对你有一定的参考价值。
分析
难度 易
来源
https://leetcode.com/problems/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.
解答
Runtime: 0 ms, faster than 100.00% of Java online submissions for Maximum Depth of Binary Tree.
1 package LeetCode; 2 3 public class L104_MaxDepthOfBinaryTree { 4 public int maxDepth(TreeNode root) { 5 if(root==null){ 6 return 0; 7 } 8 int depth=1; 9 depth+=Math.max(maxDepth(root.left),maxDepth(root.right)); 10 return depth; 11 } 12 }
以上是关于LeetCode 104. Maximum Depth of Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode104. Maximum Depth of Binary Tree
leetcode104-Maximum Depth of Binary Tree
Leetcode刷题记录[python]——104 Maximum Depth of Binary Tree
LeetCode 104. Maximum Depth of Binary Tree
[Lintcode]97. Maximum Depth of Binary Tree/[Leetcode]104. Maximum Depth of Binary Tree